4 search results - page 1 / 1 » Approximating connected facility location problems via rando... |
134
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
117
click to vote
JCSS
2010
15 years 1 months ago
2010
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
140
click to vote
ICALP
2010
Springer
15 years 8 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...
138
click to vote
ESA
2008
Springer
15 years 5 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...