Computational geometry: an introduction
Computational geometry: an introduction
Partitioning a polygonal region into trapezoids
Journal of the ACM (JACM)
Efficient algorithms for geometric graph search problems
SIAM Journal on Computing
Algorithms for routing and testing routability of planar VLSI layouts
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Optimal Three-Layer Channel Routing
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Circle graphs
A new approach to topological via minimization
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Single-Layer Routing for VLSI: Analysis and Algorithms
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Pad Assignment for Power Nets in VLSI Circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
| Hi-index | 0.00 |
The problem of finding a maximum-weighted planar subset of n multi-terminal nets in a global routing with w modules is considered. When w = 0, an optimal algorithm, running in O(n log n + t) time in bipartite regions (channels) and in O(nt) time in arbitrary regions (switchboxes), is presented; where t is the total number of terminals. For arbitrary w, the problem is shown to be NP-hard. For a fixed w, an O(n^w^+^1t) time algorithm, suitable for regions with small numbers of modules (e.g. a 'ring' where w = 1) is presented.