Paper Info
Title
Fast Algorithms for One-Dimensional Compaction with Jog Insertion
Abstract
Introduction. The one-dimensional channel compaction problem with automaticjog insertion may be described informally as follows. We are given n horizontalwire segments organized into t tracks. Segments on the same track have the samey-coordinate and the ranges of their x-coordinates do not overlap. Each segment hasa via at each end, connecting it to vertical wires on another layer. The goal is tominimize channel height subject to design rule constraints on the distances betweenwires and...
Year
DOI
Venue
1993
10.1007/3-540-57155-8_282
WADS
Keywords
Field
DocType
jog insertion,fast algorithms,one-dimensional compaction,design rules
Computer science,Algorithm,Communication channel,Jog,Compaction
Conference
ISBN
Citations 
PageRank 
3-540-57155-8
0
0.34
References 
Authors
7
2
Name
Order
Citations
PageRank
Matthias F. M. Stallmann116619.38
Thomas A. Hughes291.57