The k-centrum multi-facility location problem

Discrete Applied Mathematics

Volumn 109, Issue 3, 2001, Pages 293-307

  Tamir, Arie ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Center location problem; Centrum location problem; Median location problem; Tree graphs

Indexed keywords

EID: 0001666444     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00253-5     Document Type: Article

References (25)

1. Agarwal P.K., Aronov B., Chan T.M., Sharir M. On levels in arrangements of lines, segments, planes and triangles. Discrete Comput. Geom. 19:1998;315-331.
2. Andreatta G., Mason F.M. k -eccentricity and absolute k -centrum of a tree European J. Oper. Res. 19:1985;114-117.
3. Andreatta G., Mason F.M. Properties of the. k -centrum in a network Networks. 15:1985;21-25.
4. Y. Bartal, On approximating arbitrary metrics by tree metrics, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 161-168.
5. Blum M., Floyd R.W., Pratt V., Rivest R.L., Tarjan R.E. Time bounds for selection. J. Comput. Systems Sci. 7:1973;448-461.
6. M. Charikar, C. Chekuri, A. Goel, S. Guha, Rounding via trees: deterministic approximation algorithms for group Steiner trees and k -median, Proceedings of the 30th Annual ACM Symposium on Theory of Computing, 1998, pp. 114-123.
7. M. Charikar, S. Guha, Improved combinatorial algorithms for the facility location and k -median problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999, pp. 378-388.
8. M. Charikar, S. Guha, E. Tardos, D.B. Shmoys, A constant-factor approximation algorithm for the k -median problem, Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 1-10.
9. Cole R. Slowing down sorting networks to obtain faster sorting algorithms. J. ACM. 34:1987;200-208.
10. Dey T.K. Improved bounds for planar. k -sets and related problems Discrete Comput. Geom. 19:1998;373-382.
11. Edelsbrunner H., Welzl E. Constructing belts in two-dimensional arrangements with applications. SIAM J. Comput. 15:1986;271-284.
12. Eppstein D. Geometric lower bounds for parametric matroid optimization. Discrete Comput. Geom. 20:1998;463-476.
13. Fredman M., Tarjan R.E. Fibonacci heaps and their uses in network optimization algorithms. J. ACM. 34:1987;596-615.
14. Hassin R., Tamir A. Improved complexity bounds for location problems on the real line. Oper. Res. Lett. 10:1991;395-402.
15. Hsu V.N., Lowe T.J., Tamir A. Structured. p -facility location problems on the line solvable in polynomial time Oper. Res. Lett. 21:1997;159-164.
16. K. Jain, V.V. Vazirani, Primal-dual approximation algorithms for metric facility location and k -median problems, Proceedings of the 40th Annual Symposium on Foundations of Computer Science 1999, pp. 1-10.
17. Kariv O., Hakimi L.S. An algorithmic approach to network location problems. Part I: The. p -centers SIAM J. Appl. Math. 37:1979;513-538.
18. Kariv O., Hakimi L.S. An algorithmic approach to network location problems. Part II: The. p -medians SIAM J. Appl. Math. 37:1979;539-560.
19. Megiddo N. Applying parallel computation algorithms in the design of serial algorithms. J. ACM. 30:1983;852-865.
20. Megiddo N., Tamir A. New results on the complexity of. p -center problems SIAM J. Comput. 12:1983;751-758.
21. Peeters P.H. Some new algorithms for location problems on networks. European J. Oper. Res. 104:1998;299-309.
22. Sharir M., Agarwal P.K. Davenport-Schinzel Sequences and Their Geometric Applications. 1995;Cambridge University Press, New York.
23. Slater P.J. Centers to centroids in a graph. J. Graph Theory. 2:1978;209-222.
24. 2) algorithm for the p -median and related problems on tree graphs Oper. Res. Lett. 19:1996;59-64.
25. Wilber R. The concave least weight subsequence revisited. J. Algorithms. 9:1988;418-425.