Shortest path search using tiles and piecewise linear cost propagation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 21, Issue 2, 2002, Pages 145-158

  Xing, Zhaoyun ^a,b   Kao, Russell ^b  

^a IEEE   (United States)

^b SUN MICROSYSTEMS   (United States)

Author keywords

Design automation; Piecewise linear approximation; Routing; Search methods; VLSI

Indexed keywords

PIECEWISE LINEAR APPROXIMATION; SHORTEST PATH SEARCH;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER AIDED DESIGN; GRAPH THEORY; MATHEMATICAL MODELS; PIECEWISE LINEAR TECHNIQUES; VLSI CIRCUITS;

INTEGRATED CIRCUIT LAYOUT;

EID: 0036474102     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/43.980255     Document Type: Article

References (16)

1. A solution to the line routing problem on a continuous plane
2. A computer program for optimal routing of printed circuit connectors
3. An algorithm for path connections and its applications
4. The shortest path algorithm for grid graphs
5. 2) time
6. Rectilinear shortest paths and minimum spanning trees in the presence of rectilinear obstacles
7. Finding obstacle-avoiding shortest paths using implicit connection graphs
8. An implicit connection graph maze routing algorithm for eco routing
9. An interactive maze router with hints
10. Corner stitching: A data-structuring technique for VLSI layout tools
11. A tile-expansion router
12. An H-V alternating router
13. Contour: A tile-based gridless router
14. Chip-level area routing