27 search results - page 5 / 6 » An Improved LP-based Approximation for Steiner Tree |
SODA
2003
ACM
13 years 6 months ago
2003
ACM
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...
ICALP
2010
Springer
13 years 10 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...
SIAMCOMP
2008
13 years 5 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...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a problem that is a common generalization of the uncapacitated facility location (UFL) and minimum latency (ML) problems, where facilities not only need to be opened ...