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
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
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
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
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Parallel and Distributed Systems
On packing and coloring hyperedges in a cycle
Discrete Applied Mathematics
On packing and coloring hyperedges in a cycle
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Journal of Combinatorial Optimization
| Hi-index | 0.89 |
The problem of Weighted Hypergraph Embedding in a Cycle (WHEC) is to embed the weighted hyperedges of a hypergraph as adjacent paths around a cycle, such that the maximum congestion over any physical link in the cycle is minimized. In this paper, we first show that even when hyperedges contain exactly two vertices, the WHEC problem is NP-complete. Afterwards we formulate the problem as an Integer Linear Program (ILP). Then, a solution with approximation ratio of two is presented by using LP-based rounding algorithm. Finally, to improve the efficiency, we develop a linear-time approximation algorithm to provide an embedding with congestion at most two times the optimum.