Faster optimal single-row placement with fixed ordering

Proceedings -Design, Automation and Test in Europe, DATE

Volumn , Issue , 2000, Pages 117-121

  Brenner, U ^a   Vygen, J ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDING BOX; FIXED-ORDER; RUNNING TIME;

EXHIBITIONS;

EID: 54549117207     PISSN: 15301591     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DATE.2000.840026     Document Type: Conference Paper

References (3)

1. M. R. Gaarey, D. S. Johanson, L. Stockmayer: Some Simplified NP-Complete Graph Problem. Theoretical Computer Science 1 (1976), 237-267.
2. A. B. Kahng, P. Tucker, A. Zelikovsky: Optimization of Linear Placements for Wirelength Minimization with Free sites. Proc. Of the Asia and South Pacific Design Automation Conference, 1999, 241-244
3. J. Vygen: Algorithm for Detailed Placement of Standard Cells. Proc. of the Conference Design, Automation and Test in Europe (DATE'98), IEEE 1998, 321-324