A 1.6 approximation algorithm for routing multiterminal nets
SIAM Journal on Computing
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
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)
Pad placement and ring routing for custom chip layout
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Algorithms for routing around a rectangle
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Provably Good Moat Routing Algorithm
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
Geometric interconnection and placement algorithms
Geometric interconnection and placement algorithms
A Simple Approximation Algorithm for Two Problems in Circuit Design
IEEE Transactions on Computers
On minimizing the maximum congestion for Weighted Hypergraph Embedding in a Cycle
Information Processing Letters
A 1.5 Approximation Algorithm for Embedding Hyperedges in a Cycle
IEEE Transactions on Parallel and Distributed Systems
Efficient Algorithms for Minimum Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Parallel and Distributed Systems
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
Information Processing Letters
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 a directed hypergraph on a ring
Information Processing Letters
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
On packing and coloring hyperedges in a cycle
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
An approximation algorithm for embedding a directed hypergraph on a ring
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
A polynomial time approximation scheme for embedding a directed hypergraph on a weighted ring
Journal of Combinatorial Optimization
| Hi-index | 14.99 |
The minimum-congestion hypergraph embedding in a cycle (MCHEC) problem is to embed the n edges in an m-vertex hypergraph as paths in a cycle on the same number of vertices, such that congestion驴the maximum number of paths that use any single edge in the cycle驴is minimized. The MCHEC problem has applications in electronic design automation and parallel computing. In this paper, it is proven that the MCHEC problem is NP-complete. An O((nm)k+1) algorithm is described that computes an embedding with congestion k or determines that such an embedding does not exist. Finally, a linear-time approximation algorithm for arbitrary instances is presented that computes an embedding whose congestion is at most three times optimal.