When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Provisioning a virtual private network: a network design problem for multicommodity flow
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The general Steiner tree-star problem
Information Processing Letters
A Constant-Factor Approximation Algorithm for the Multicommodity
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximation algorithms for a capacitated network design problem
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Energy-efficient caching strategies in ad hoc wireless networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Simpler and better approximation algorithms for network design
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Cross-monotonic cost sharing methods for connected facility location games
Theoretical Computer Science
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Playing push vs pull: models and algorithms for disseminating dynamic data in networks
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Efficient cache placement in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Approximating connected facility location problems via random facility sampling and core detouring
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Improved approximation algorithm for connected facility location problems
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Connected facility location via random facility sampling and core detouring
Journal of Computer and System Sciences
Network design via core detouring for problems without a core
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Contention-aware data caching in wireless multi-hop ad hoc networks
Journal of Parallel and Distributed Computing
INFORMS Journal on Computing
From Uncertainty to Nonlinearity: Solving Virtual Private Network via Single-Sink Buy-at-Bulk
Mathematics of Operations Research
Improved approximation for single-sink buy-at-bulk
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Hi-index | 0.00 |
We consider the Connected Facility Location problem. We are given a graph G = (V, E) with cost ce on edge e, a set of facilities F 驴 V, and a set of demands D 驴 V. We are also given a parameter M 驴 1. A solution opens some facilities, say F, assigns each demand j to an open facility i(j), and connects the open facilities by a Steiner tree T. The cost incurred is 驴i驴F fi + 驴j驴D djci(j)j + M 驴e驴T ce. We want a solution of minimum cost. A special case is when all opening costs are 0 and facilities may be opened anywhere, i.e., F = V. If we know a facility v that is open, then this problem reduces to the rent-or-buy problem. We give the first primal-dual algorithms for these problems and achieve the best known approximation guarantees. We give a 9-approximation algorithm for connected facility location and a 5-approximation for the rent-or-buy problem. Our algorithm integrates the primal-dual approaches for facility location [7] and Steiner trees [1,2]. We also consider the connected k-median problem and give a constant-factor approximation by using our primal-dual algorithm for connected facility location. We generalize our results to an edge capacitated version of these problems.