Title :
An optimal algorithm for maximum two planar subset problem [VLSI layout]
Author :
Panyam, Anand ; Danda, Srinivasa ; Madhwapathy, Sreekrishna ; Sherwani, Naveed
Author_Institution :
Design Technol., Intel Corp., Hillsboro, OR, USA
Abstract :
The Two Row Maximum Planar Subset (TRMPS) problem asks for finding the maximum planar subset of nets, that can be routed between two rows of terminals an a cell row. This problem was first encountered by Gong, Liu, and Preas (1990). They declared it open, and presented an approximation algorithm for this problem. In this paper we show that TRMPS problem can be solved optimally in polynomial time, and we present an O(kn2) algorithm to solve this problem. Our algorithm can also be extended to solve the TRMPS problem, in the presence of pre-routed nets, a chosen subset of nets, as well as for planar channel routing. We also apply our technique to obtain an improved approximation algorithm, for over the cell routing in middle terminal model standard cell layouts
Keywords :
VLSI; circuit layout CAD; computational complexity; network routing; optimisation; set theory; O(kn2) algorithm; VLSI layout; approximation algorithm; maximum two planar subset problem; middle terminal model; optimal algorithm; over the cell routing; planar channel routing; polynomial time; prerouted nets; standard cell layouts; two row problem; Algorithm design and analysis; Approximation algorithms; Computer science; Polynomials; Routing; Very large scale integration;
Conference_Titel :
VLSI, 1994. Design Automation of High Performance VLSI Systems. GLSV '94, Proceedings., Fourth Great Lakes Symposium on
Conference_Location :
Notre Dame, IN
Print_ISBN :
0-8186-5610-7
DOI :
10.1109/GLSV.1994.289991
