Multiterminal global routing: A deterministic approximation scheme

Algorithmica

Volumn 6, Issue 1-6, 1991, Pages 73-82

  Raghavan, Prabhakar ^a   Thompson, Clark D ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b UNIVERSITY OF MINNESOTA DULUTH   (United States)

Author keywords

Approximation algorithm; Global routing

Indexed keywords

LOGIC DESIGN; MATHEMATICAL TECHNIQUES - ALGORITHMS;

GATE ARRAYS; GLOBAL ROUTING; ROUTING ALGORITHMS;

LOGIC DEVICES;

EID: 0004912503     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/BF01759035     Document Type: Article

References (12)

1. “Integer-Making” Theorems
2. Hierarchical Wire Routing
3. A New Polynomial-Time Algorithm for Linear Programming
4. Global Wiring by Simulated Annealing
5. An Algorithm for Path Connections and Its Applications
6. An O(¦V¦3) Algorithm for Finding Maximum Flows in Networks
7. Experimental Results with a Linear Program Global Router
8. Balancing Families of Sets
9. Randomized Rounding and Discrete Ham-Sandwich Theorems: Provably Good Algorithms for Routing and Packing Problems