scholar.google.com › citations
There are plenty of NP-complete problems in VLSI design, like channel routing or switchbox routing in the 2-layer Manhattan model. However, there are quite ...
May 12, 2000 · There are plenty of NP-complete problems in VLSI design, like channel routing or switchbox routing in the 2-layer Manhattan model.
Channel routing is one of the basic problems in VLSI routing. While the minimum width can be found in linear time in the single row routing problem, the ...
Dec 2, 2010 · In this paper, we present a polynomial time algorithm for the global routing problem based on integer programming formulation with a ...
In this paper, we show that the diode insertion and routing problem for an arbitrary given number of routing layers can be optimally solved in polynomial time.
People also ask
What are the two types of routing in VLSI?
What is the routing stage in VLSI?
What is global routing and detailed routing in VLSI?
In this thesis, we have presented a polynomial time approximation algorithm for the global routing problem in VLSI design which has a theoretical approx-.
“VLSI Routing in Polynomial Time” is a paper by András Recski published in 2000. It has an Open Access status of “closed”. You can read and download a PDF Full ...
Jun 1, 2013 · Efficient polynomial-time algorithms are available to solve this problem. Manhattan Model: Most of the detailed routers, we shall present ...
ABSTRACT. Aim of this paper is to describe a multi-layer grid routing algorithm which gives a better result over the existing algorithms.
VLSI Routing in Polynomial Time. András Recski. VLSI Routing in Polynomial Time. Electronic Notes in Discrete Mathematics, 5:274-277, 2000.