The Community for Technology Leaders
Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
ISBN: 978-0-7695-3507-4
pp: 86-90
ABSTRACT
A rings cycle is an undirected graph obtained from a cycle by replacing each edge of the cycle with a ring so that two rings corresponding to the two end-nodes of any edge have precisely one node in common. Given a weighted hypergraph on a rings cycle, Minimum-Congestion Weighted Hypergraph Embedding in a Rings Cycle (WHERC) is to embed each weighted hyperedges as a path in the rings cycle such that maximal congestion-the sum of weight of embedding paths that use any edge in the rings cycle-is minimized.We prove that the WHERC problem is NP-complete. 2-approximation algorithms are presented for the WHERC problem and a related problem-WDHETR.
INDEX TERMS
hypergraph; embedding; polynomial-time approximation scheme (PTAS); integer linear programming(ILP)
CITATION

X. Zheng, X. Liu, C. Li and Q. Wang, "Minimum-Congestion Weighted Hypergraph Embedding in a Rings Cycle," 2009 WRI World Congress on Computer Science and Information Engineering, CSIE(CSIE), Los Angeles, CA, 2009, pp. 86-90.
doi:10.1109/CSIE.2009.57
78 ms
(Ver 3.3 (11022016))