172412
20181203022557.0
doi
10.1016/j.jcss.2010.02.001
ISI
000281501900002
ARTICLE
Connected facility location via random facility sampling and core detouring
2010
2010
Journal Articles
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 unconnected facility location problem, randomly sample the clients, and open the facilities serving sampled clients in the approximate solution. Via a novel analytical tool, which we term core detouring, we show that this approach significantly improves over the previously best known approximation ratios for several NP-hard network design problems. For example, we reduce the approximation ratio for the connected facility location problem from 8.55 to 4.00 and for the single-sink rent-or-buy problem from 3.55 to 2.92. The mentioned results can be derandomized at the expense of a slightly worse approximation ratio. The versatility of our framework is demonstrated by devising improved approximation algorithms also for other related problems. (C) 2010 Elsevier Inc. All rights reserved.
Connected facility location
Approximation algorithm
Randomized algorithm
Network design
Approximation Algorithms
Network Design
Steiner Problem
Simpler
240331
Eisenbrand, Friedrich
183121
Grandoni, Fabrizio
243826
Rothvoss, Thomas
183730
Schafer, Guido
76
709-726
Journal Of Computer And System Sciences
252111
DISOPT
U11879
oai:infoscience.tind.io:172412
SB
article
183121
EPFL-ARTICLE-172412
EPFL
REVIEWED
PUBLISHED
ARTICLE