A novel eigenvector technique for large scale combinatorial problems in VLSI layout

Journal of Combinatorial Optimization

Volumn 6, Issue 3, 2002, Pages 271-286

  Behjat, Laleh ^a   Kucar, Dorothy ^a   Vannelli, Anthony ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Combinatorial optimization; Eigenvectors; Global routing; Linear relaxation; Partitioning; VLSI layout

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; HEURISTIC METHODS; INTEGRATED CIRCUIT LAYOUT; LINEAR PROGRAMMING; MATRIX ALGEBRA; POLYNOMIALS; VLSI CIRCUITS;

COMBINATORIAL OPTIMIZATIONS;

COMBINATORIAL MATHEMATICS;

EID: 0036722256     PISSN: 13826905     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1014847925683     Document Type: Article

References (29)

1. Geometric embeddings for faster and better multi-way netlist partitioning
2. Tabu search: A meta heuristic for netlist partitioning
3. An algorithm for partitioning the nodes of a graph
4. Improving global routing using congestion estimation
5. A weighted Steiner tree-based global router with simultaneous length and density minimization
6. Multi-way partitioning with pairwise movement
7. Lower bounds for the partitioning of graphs
8. Attractor-Repeller approach for global placement
9. A linear-time heuristic for improving network partitions
10. Multi-terminal network flows
11. An efficient eigenvector approach for finding netlist partitions
12. Fast spectral methods for ratio cut partitioning and clustering
13. An r-dimensional quadratic placement algorithm
14. Multilevel k-way hypergraph partitioning
15. An efficient heuristic procedure for partitioning graphs
16. Benchmarks for layout synthesis-evolution and current status
17. A Novel eigenvector technique for VLSI circuit layout
18. A novel linear ordering technique
19. Provably good global routing of integrated circuits
20. Eigensolutions in top-down layout design
21. Randomized rounding: A technique for provably good algorithms and algorithmic proofs
22. An adaptation of the interior point method for solving the global routing problem