loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design, Automation and Test in Europe (DATE '00)
Faster Optimal Single-Row Placement with Fixed Ordering
Paris, France
March 27-March 30
ISBN: 0-7695-0537-6
ASCII Text
x 
 
U. Brenner, J. Vygen, "Faster Optimal Single-Row Placement with Fixed Ordering," Design, Automation and Test in Europe Conference and Exhibition, pp. 117, Design, Automation and Test in Europe (DATE '00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/DATE.2000.840026,
author = {U. Brenner and J. Vygen},
title = {Faster Optimal Single-Row Placement with Fixed Ordering},
journal ={Design, Automation and Test in Europe Conference and Exhibition},
volume = {0},
year = {2000},
issn = {1530-1591},
pages = {117},
doi = {http://doi.ieeecomputersociety.org/10.1109/DATE.2000.840026},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Design, Automation and Test in Europe Conference and Exhibition
TI - Faster Optimal Single-Row Placement with Fixed Ordering
SN - 1530-1591
SP
EP
A1 - U. Brenner,
A1 - J. Vygen,
PY - 2000
VL - 0
JA - Design, Automation and Test in Europe Conference and Exhibition
ER -
 
U. Brenner, University of Bonn
J. Vygen, University of Bonn
We consider the problem of placing a set of cells in a single row with a given horizontal ordering, minimizing the (weighted) bounding box netlength. We analyze the running time of an algorithm of Kahng, Tucker and Zelikovsky, which solves this problem optimally. By using different data structures we are able to improve the worst-case running time in the unweighted case as well as in the presence of netweights.
Citation:
U. Brenner, J. Vygen, "Faster Optimal Single-Row Placement with Fixed Ordering," date, pp.117, Design, Automation and Test in Europe (DATE '00), 2000
Usage of this product signifies your acceptance of the Terms of Use.