This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 WRI World Congress on Computer Science and Information Engineering
Minimum-Congestion Weighted Hypergraph Embedding in a Rings Cycle
Los Angeles, California USA
March 31-April 02
ISBN: 978-0-7695-3507-4
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:
Qi Wang, Xiaoshan Liu, Xiaowei Zheng, Chunlin Li, "Minimum-Congestion Weighted Hypergraph Embedding in a Rings Cycle," csie, vol. 3, pp.86-90, 2009 WRI World Congress on Computer Science and Information Engineering, 2009
Usage of this product signifies your acceptance of the Terms of Use.