TY  - RPRT
T1  - Local routing of two-terminal nets is easy (extended abstract)
T3  - Saarbrücken, 1984
A1  - Kaufmann,Michael
A1  - Mehlhorn,Kurt
Y1  - 2011/09/02
N2  - A 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).
CY  - Saarbrücken
PB  - Universitäts- und Landesbibliothek
AD  - Postfach 151141, 66041 Saarbrücken
UR  - http://scidok.sulb.uni-saarland.de/volltexte/2011/4156
ER  -