Subscribe

Los Angeles, CA

March 31, 2009 to April 2, 2009

ISBN: 978-0-7695-3507-4

pp: 86-90

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.57

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

Xiaoshan Liu,
Xiaowei Zheng,
Qi Wang,
"Minimum-Congestion Weighted Hypergraph Embedding in a Rings Cycle",

*CSIE*, 2009, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE, 2009 WRI World Congress on Computer Science and Information Engineering, CSIE 2009, pp. 86-90, doi:10.1109/CSIE.2009.57