Approximation algorithms for network design and facility location with service capacities

Authors:
Jens Maßberg;Jens Vygen
Affiliations:
Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany;Research Institute for Discrete Mathematics, University of Bonn, Bonn, Germany
Venue:
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Year:
2005

Citing 8
Cited 3

On better heuristic for euclidean Steiner minimum trees (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems

Journal of the ACM (JACM)
Improved approximation algorithms for a capacitated facility location problem

Proceedings of the tenth 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
The vehicle routing problem

The vehicle routing problem
Clock Scheduling and Clocktree Construction for High Performance ASICS

Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design
An efficient approximation scheme for the one-dimensional bin-packing problem

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms

Efficient generation of short and fast repeater tree topologies

Proceedings of the 2006 international symposium on Physical design
Approximation algorithms for a facility location problem with service capacities

ACM Transactions on Algorithms (TALG)
An algorithm for routing with capacitance/distance constraints for clock distribution in microprocessors

Proceedings of the 2009 international symposium on Physical design

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present the first constant-factor approximation algorithms for the following problem: Given a metric space (V,c), a set D⊆V of terminals/ customers with demands d:D→ℝ+, a facility opening cost f∈ℝ+ and a capacity u∈ℝ+, find a partition $D=D_1\dot{\cup}\cdots\dot{\cup} D_k$ and Steiner trees Ti for Di (i=1,...,k) with c(E(Ti))+d(Di)≤ u for i=1,...,k such that ∑$_{i=1}^{k}$c(E(Ti)) + kf is minimum. This problem arises in VLSI design. It generalizes the bin-packing problem and the Steiner tree problem. In contrast to other network design and facility location problems, it has the additional feature of upper bounds on the service cost that each facility can handle. Among other results, we obtain a 4.1-approximation in polynomial time, a 4.5-approximation in cubic time and a 5-approximation as fast as computing a minimum spanning tree on (D,c).