A polynomial algorithm for the p-centdian problem on a tree

Networks

Volumn 32, Issue 4, 1998, Pages 255-262

  Tamir, Arie ^a   Pérez Brito, Dionisio ^b   Moreno Pérez, José A ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSIDAD DE LA LAGUNA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0040577818     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199812)32:4<255::AID-NET2>3.0.CO;2-O     Document Type: Article

References (20)

1. Y. Bartal, Probabilistic approximation of metric spaces and its algorithmic applications. Technical Report, International Computer Science Institute, Berkeley, CA (1997).
2. Y. Bartal, Private communication (Sept. 1997).
3. E. J. Carrizosa, E. Conde, F. R. Fernández, and J. Puerto, An axiomatic approach to the cent-dian criterion. Loc. Sci. 3 (1994) 1-7.
4. R. Cole, Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34 (1987) 200-208.
5. P. M. Dearing, R. L. Francis, and T. J. Lowe, Convex location problems on tree networks. Oper. Res. 24 (1976) 628-642.
6. G. N. Frederickson, Optimal algorithms for partitioning trees and locating p-centers in trees. Technical Report, Department of Computer Science, Purdue University (1990).
7. A. J. Goldman, Optimal center location in simple networks. Trans. Sci. 5 (1971) 212-221.
8. J. Halpern, The location of a cent-dian convex combination on an undirected tree. J. Reg. Sci. 16 (1976) 237-245.
9. J. Halpern, Finding minimal center-median convex combination (cent-dian) of a graph. Mgmt. Sci. 24 (1978) 535-544.
10. J. Halpern, Duality in the cent-dian of a graph. Oper. Res. 28 (1980) 722-735.
11. G. Y. Handler, Medi-centers of a tree. Trans. Sci. 19 (1985) 246-260.
12. R. Hassin and A. Tamir, Improved complexity bounds for location problems on the real line. Oper. Res. Lett. 10 (1991) 395-402.
13. T. U. Kim, T. J. Lowe, A. Tamir, and J. E. Ward, On the location of a tree-shaped facility. Networks 28 (1996) 167-175.
14. 3 and related problems. SIAM J. Comput. 12 (1983) 751-758.
15. N. Megiddo and A. Tamir, New results on the complexity of p-center problems. SIAM J. Comput. 12 (1983) 751-758.
16. P. B. Mirchandani and R. L. Francis, Eds., Discrete Location Theory. Wiley, New York (1990).
17. D. Pérez-Brito, J. A. Moreno-Pérez, and I. Rodríguez-Martín, The 2-facility centdian network problem. Loc. Sci., to appear.
18. D. Pérez-Brito, J. A. Moreno-Pérez, and I. Rodríguez-Martín, The finite dominating set for the p-facility centdian network location problem. Stud. Loc. Anal., 11 (1997) 27-40.
19. 2) algorithm for the p-median and related problems on tree graphs. Oper. Res. Lett. 19 (1996) 59-64.
20. E. Zemel, An O(n) algorithm for the linear multiple choice knapsack problem and related problems. Info. Process. Lett. 18 (1984) 123-128.