A primal-dual approximation algorithm for the Steiner forest problem
Information Processing Letters
When Trees Collide: An Approximation Algorithm for theGeneralized Steiner Problem on Networks
SIAM Journal on Computing
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
A constant-factor approximation algorithm for the k-median problem (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Analysis of a local search heuristic for facility location problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A constant factor approximation for the single sink edge installation problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new greedy approach for facility location problems
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Approximating the Single-Sink Link-Installation Problem in Network Design
SIAM Journal on Optimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap
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
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The Access Network Design Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Improved Combinatorial Algorithms for the Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Building Steiner trees with incomplete global knowledge
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Hierarchical placement and network design problems
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Primal-Dual Algorithms for Connected Facility Location Problems
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Multicommodity facility location
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Network design for information networks
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the approximability of some network design problems
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We initiate a study of the approximability of integrated logistics problems that combine elements of facility location and the associated transport network design.In the simplest version, we are given a graph G = (V,E) with metric edge costs c, a set of potential facilities F 驴 V with nonnegative facility opening costs 驴, a set of clients D 驴 V (each with unit demand), and a positive integer u (cable capacity). We wish to open facilities and construct a network of cables, such that every client is served by some open facility and all cable capacities are obeyed. The objective is to minimize the sum of facility opening and cable installation costs. With only one zero-cost facility and infinite u, this is the Steiner tree problem, while with unit capacity cables this is the Uncapacitated Facility Location problem. We give a (驴ST +驴UFL)-approximation algorithm for this problem, where 驴P denotes any approximation ratio for problem P.For an extension when the facilities don't have costs but no more than p facilities may be opened, we provide a bicriteria approximation algorithm that has total cost at most 驴p-MEDIAN+2 times the minimum but opens up to 2p facilities.Finally, for the general version with k different types of cables, we extend the techniques of [Guha, Meyerson, Munagala, STOC 2001] to provide an O(k) approximation.