13 search results - page 3 / 3 » A Fast and Stable Algorithm for Obstacle-Avoiding Rectilinea... |
DAC
1989
ACM
13 years 9 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
STOC
2003
ACM
14 years 5 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
TCAD
2002
13 years 4 months ago
2002
Abstract--This paper presents a solution to the problem of performance-driven buffered routing tree generation for VLSI circuits. Using a novel bottom-up construction algorithm and...