Cart (Loading....) | Create Account
Close category search window
 

A 1.5 approximation algorithm for embedding hyperedges in a cycle

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Sing Ling Lee ; Dept. of Comput. Sci. & Inf. Eng., Nat. Chung-Cheng Univ., Ming-Hsiung, Taiwan ; Hann-Jang Ho

The problem of minimum congestion hypergraph embedding in a cycle (MCHEC) is to embed the hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. The problem is NP-complete in general, but solvable in polynomial time when all hyperedges contain exactly two vertices. In this paper, we first formulate the problem as an integer linear program (ILP). Then, a solution with approximation bound of 1.5(opt + 1) is presented by using a clockwise (2/3)-rounding algorithm, where opt denotes the optimal value of maximum congestion. To our knowledge, this is the best approximation bound known for the MCHEC problem.

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:16 ,  Issue: 6 )

Date of Publication:

June 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.