1671 search results - page 101 / 335 » On the Covering Steiner Problem |
166
click to vote
CAD
2005
Springer
15 years 6 months ago
2005
Springer
Industrial Geometry aims at unifying existing and developing new methods and algorithms for a variety of application areas with a strong geometric component. These include CAD, CA...
160
click to vote
TCAD
2002
15 years 6 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...
183
click to vote
AMAI
2000
Springer
15 years 10 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
165
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We give a 7.18-approximation algorithm for the minimum latency problem that uses only O(n log n) calls to the prize-collecting Steiner tree (PCST) subroutine of Goemans and Willia...
194
click to vote
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...