Approximation algorithms for network design and facility location with service capacities

Lecture Notes in Computer Science

Volumn 3624, Issue , 2005, Pages 158-169

  Maßberg, Jens ^a   Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COSTS; CUSTOMER SATISFACTION; INTEGRATED CIRCUIT LAYOUT; PROBLEM SOLVING; VLSI CIRCUITS;

APPROXIMATION ALGORITHMS; CUSTOMERS; NETWORK DESIGN; POLYNOMIAL TIME;

POLYNOMIAL APPROXIMATION;

EID: 26944496035     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11538462_14     Document Type: Conference Paper

References (18)

1. S. Arora. Polynomial time approximation schemes for euclidean tsp and other geometric problems. In Journal of the ACM 45, pages 753-782, 1998.
2. N. Christofides. Worst-case analysis of a new heuristic for the traveling salesman problem. Technical report, CS-93-13, G.S.I.A., Carnegie Mellon University, Pittsburgh, 1976.
3. F. A. Chudak and D. B. Shmoys. Improved approximation algorithms for a capacitated facility location problem. In Proceedings of the 10th annual ACM-SIAM symposium on Discrete algorithms (SODA '99), pages 875-876, 1999.
4. D.-Z. Du, Y. Zhang, and Q. Feng. On better heuristic for Euclidean Steiner minimum trees. In 32nd Annual IEEE Symposium on Foundations of Computer Science, pages 431-439, 1991.
5. G. Even, N. Garg, J. Könemann, R. Ravi, and A. Sinha. Covering graphs using trees and stars. In Proceddings of 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 7th International Workshop on Randomization and Approximation Techniques in Computer Science (APPROX-RANDOM), pages 24-35, 2003.
6. M. R. Garey, R. L. Graham, and D. S. Johnson. The complexity of computing steiner minimal trees. In SIAM Journal on Applied Mathematics 38, pages 835-859, 1977.
7. M.R. Garey and D.S. Johnson. The rectilinear steiner problem is np-complete. In SIAM Journal on Applied Mathematics 32, pages 826-834, 1977.
8. M. Hanan. On steiner's problem with rectilinear distance. SIAM Journal on Applied Mathematics 14(2), pages 255-265, 1966.
9. S. Held, B. Korte, J. Maßberg, M. Ringe, and J. Vygen. Clock scheduling and clocktree construction for high performance asics. In Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (ICCAD '03), pages 232-240. IEEE Computer Society, 2003.
10. F.K. Hwang. On steiner minimal trees with rectilinear distance. In SIAM Journal on Applied Mathematics 30, pages 104-114, 1976.
11. N. Karmarkar and R. M. Karp. An efficient approximation scheme for the one-dimensional bin packing problem. In 23rd Annual IEEE Symposium on Foundations of Computer Science, pages 312-320, 1982.
12. R. M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages 85-103. Plenum Press, New York, 1972.
13. B. Korte and J. Vygen. Combinatorial Optimization, Theory and Algorithms, third edition. Springer, 2005.
14. M. Mahdian, Y. Ye, and J. Zhang. A 2-approximation algorithm for the soft-capacitated facility location problem. In Proceedings of 6th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pages 129-140, 2003.
15. A. Matsuyama and H. Takahashi. An approximate solution for the steiner problem in graphs. Mathematica Japonica 24(6), pages 573-577, 1980.
16. Gabriel Robins and Alexander Zelikovsky. Improved steiner tree approximation in graphs. In Symposium on Discrete Algorithms, pages 770-779, 2000.
17. D. Simchi-Levi. New worst-case results for the bin-packing problem. In Naval Research Logistics, 41, pages 579-585, 1994.
18. P. Toth and D. Vigo, editors. The Vehicle Routing Problem. SIAM monographs on discrete mathematics and applications. 2002.