Add to ORKGA local routing problem is given by a routing region (a subgraph of the planer grid) and a set of nets. For each net a global routing is also given. The problem is to find a local routing which is consistent with the global routing (if there is one). In this paper we show that local routing problems can be sloved in time O(n(log n)2)
In this paper an O(N log N) algorithm for routing through a rectangle is presented. Consider an n-by...
We consider the channel routing problem of a set of multi- terminal nets in the knockknee model. We ...
We consider the problem of routing on a network in the presence of line segment constraints (i.e., o...
A local routing problem is given by a routing region (a subgraph of the planer grid) and a set of ne...
SIGLETIB Hannover: RO 1829(1986,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Inf...
We consider the problem of routing k two-terminal nets in the presence of obstacles in two models: t...
This thesis considers the problems arising from VLSI routing design. Algorithms are proposed for sol...
We examine bounds on the locality of routing. A local routing algorithm makes a sequence of distribu...
Despite the significant improvement on network performance provided by global routing strategies, th...
The present article concentrates on the dogleg-free Manhattan model where horizontal and ...
We consider the topological via minimization problem in which each of n nets has two terminals to be...
Local nets are a major contributing factor to mismatch be-tween the global routing (GR) and detailed...
Given a multilayer routing area, we consider the global routing problem of selecting a maximum set o...
This thesis investigates the global routing problem for integrated circuits. We introduce two formul...
We investigate the implementation of local search algorithms for routing problems with various side ...
In this paper an O(N log N) algorithm for routing through a rectangle is presented. Consider an n-by...
We consider the channel routing problem of a set of multi- terminal nets in the knockknee model. We ...
We consider the problem of routing on a network in the presence of line segment constraints (i.e., o...
A local routing problem is given by a routing region (a subgraph of the planer grid) and a set of ne...
SIGLETIB Hannover: RO 1829(1986,3) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische Inf...
We consider the problem of routing k two-terminal nets in the presence of obstacles in two models: t...
This thesis considers the problems arising from VLSI routing design. Algorithms are proposed for sol...
We examine bounds on the locality of routing. A local routing algorithm makes a sequence of distribu...
Despite the significant improvement on network performance provided by global routing strategies, th...
The present article concentrates on the dogleg-free Manhattan model where horizontal and ...
We consider the topological via minimization problem in which each of n nets has two terminals to be...
Local nets are a major contributing factor to mismatch be-tween the global routing (GR) and detailed...
Given a multilayer routing area, we consider the global routing problem of selecting a maximum set o...
This thesis investigates the global routing problem for integrated circuits. We introduce two formul...
We investigate the implementation of local search algorithms for routing problems with various side ...
In this paper an O(N log N) algorithm for routing through a rectangle is presented. Consider an n-by...
We consider the channel routing problem of a set of multi- terminal nets in the knockknee model. We ...
We consider the problem of routing on a network in the presence of line segment constraints (i.e., o...