Approximation algorithms for a facility location problem with service capacities

ACM Transactions on Algorithms

Volumn 4, Issue 4, 2008, Pages

  Maberg, Jens ^a   Vygen, Jens ^a  

^a UNIVERSITY OF BONN   (Germany)

Author keywords

Approximation algorithm; Facility location; Network design; VLSI design

Indexed keywords

FACILITIES; SET THEORY; TOPOLOGY;

APPROXIMATION ALGORITHM; FACILITY LOCATION; FACILITY LOCATION PROBLEMS; NETWORK DESIGN; VLSI DESIGN;

APPROXIMATION ALGORITHMS;

EID: 50849111738     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1383369.1383381     Document Type: Article

References (17)

1. ALPERT, C., KAHNG, A., LIU, B., MANDOIU, I., AND ZELIKOVSKY, A. 2003. Minimum buffered routing with bounded capacitive load for slew rate and reliability control. IEEE Trans. Comput.-Aid. Design Integra. Circuits Syst., 241-253.
2. ARORA, S. 1998. Polynomial time approximation schemes for Euclidean TSP and other geometric problems. J. ACM 45, 753-778.
3. BARTOSCHEK, C., HELD, S., RAUTENBACH, D., AND VYGEN, J. 2006. Efficient generation of short and fast repeater. In Proceedings of the International Symposium on Physical Design (ISPD'06). ACM Press, New York, NY, 120-127.
4. CHRISTOFIDES, N. 1976. Worst-case analysis of a new heuristic for the traveling salesman problem. Tech. rep. CS-93-13, G.S.I.A., Carnegie Mellon University, Pittsburgh, PA.
5. DU, D.-Z., ZHANG, Y., AND FEND, Q. 1991. On better heuristic for Euclidean Steiner minimum trees. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. 431-439.
6. EVEN, G., GARG, N., KÖNEMANN, J., RAVI, R., AND SINHA, A. 2004. Min-max tree covers of graphs. Oper. Resear. Lett. 32, 4, 309-315.
7. GAREY, M., AND JOHNSON, D. 1977. The rectilinear Steiner problem is NP-complete. SIAM J. Appl. Math. 32, 826-834.
8. GAREY, M. R., GRAHAM, R. L., AND JOHNSON, D. S. 1977. The complexity of computing Steiner minimal trees. SIAM J. Appl. Math. 32, 835-859.
9. HELD, S., KORTE, B., MAOBERG, J., RINGE, M., AND VYGEN, J. 2003. Clock scheduling and clocktree construction for high performance asics. In Proceedings of the IEEE/ACM International Conference on Computer-Aided Design (ICCAD'03). IEEE Computer Society, Washington, DC, 232-240.
10. HWANG, F. 1976. On Steiner minimal trees with rectilinear distance. SIAM J. Appl. Math. 30, 104-114.
11. KARMARKAR, N., AND KARP, R. M. 1982. An efficient approximation scheme for the one-dimensional bin packing problem. In Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science. 312-320.
12. KARP, R. M. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Miller and J. Thatcher Eds., Plenham Press, New York, NY. 85-103.
13. KORTE, B., AND VYGEN, J. 2008. Combinatorial Optimization: Theory and Algorithms 4th Ed. Springer, Berlin, Germany.
14. MAßBERG, J., AND VYGEN, J. 2005. Approximation algorithms for network design and facility location with service capacities. In Proceedings of 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX'05). Springer, 158-169.
15. ROBINS, G., AND ZELIKOVSKY, A. 2000. Improved Steiner tree approximation in graphs. In Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, Philadelphia, PA, 770-779.
16. SIMCHI-LEVI, D. 1994. New worst-case results for the bin-packing problem. Naval Resear Logistics 41, 579-585.
17. TOTH, P., AND D. VIGO, E. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia, PA.