1671 search results - page 76 / 335 » On the Covering Steiner Problem |
117
click to vote
SIAMCOMP
1998
15 years 11 days ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
120
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...
ISPD
1999
ACM
15 years 5 months ago
1999
ACM
The presence of fixed terminals in hypergraph partitioning instances arising in top-down standard-cell placement makes such instances qualitatively different from the free hyperg...
109
click to vote
SOFSEM
2010
Springer
15 years 9 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
108
click to vote
ADHOCNOW
2008
Springer
15 years 7 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...