Soit H = (X. ~1 un hypergraphe h-uniforme avec IX] = net soit L h ~(H! le graphe Jont les sommets reprdsentent les arates de H, deux sommets 6lant reli6s si et seulement si t~s z~r6tes qu'ils reprdsen!ent intersectent en h -1 sommet,=. Nous montrons que sif,, t(H) ne contienl pas de cycle, alors I~[
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
โ Scribed by SingLing Lee; Hann-Jang Ho
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 77 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.
โฆ Synopsis
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exactly two vertices, the WHEC problem is NP-complete. Afterwards we formulate the problem as an Integer Linear Program (ILP). Then, a solution with approximation ratio of two is presented by using LP-based rounding algorithm. Finally, to improve the efficiency, we develop a linear-time approximation algorithm to provide an embedding with congestion at most two times the optimum.
๐ SIMILAR VOLUMES
to the solution of a single shunter and a radio-controlled locomotive, thus eliminating the hazards associated with communications. Experience confirms the positive predictions concerning safety and workload. In the metalworks where the author is employed, remotecontrolled shunting is even performed