A 1.6 approximation algorithm for routing multiterminal nets
SIAM Journal on Computing
A bottom-up layout technique based on two-rectangle routing
Integration, the VLSI Journal
A linear time algorithm for optimal routing around a rectangle
Journal of the ACM (JACM)
Algorithms for routing around a rectangle
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
SIAM Journal on Discrete Mathematics
Improved approximation algorithms for embedding hyperedges in a cycle
Information Processing Letters
A Simple Approximation Algorithm for Two Problems in Circuit Design
IEEE Transactions on Computers
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
An Efficient Algorithm for the Ring Loading Problem with Integer Demand Splitting
SIAM Journal on Discrete Mathematics
Minimum-Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Computers
A Provably Good Moat Routing Algorithm
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics
A polynomial-time approximation scheme for embedding hypergraph in a cycle
ACM Transactions on Algorithms (TALG)
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
A polynomial time approximation scheme for embedding hypergraph in a weighted cycle
Theoretical Computer Science
| Hi-index | 0.00 |
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.