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
Minimum-Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Computers
Demand Routing and Slotting on Ring Networks
Demand Routing and Slotting on Ring Networks
A Provably Good Moat Routing Algorithm
GLSVLSI '96 Proceedings of the 6th Great Lakes Symposium on VLSI
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
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
On packing and coloring hyperedges in a cycle
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
| Hi-index | 14.98 |
This paper provides a very simple two-approximation algorithm for two NP-hard problems that arise in electronic circuit design. To our knowledge, this is the best approximation bound known for these problems. In addition, the simplicity of the proposed algorithm makes it attractive for real-time applications for similar problems in areas such as telecommunications and parallel processing.