Generalized p-center problems: Complexity results and approximation algorithms

European Journal of Operational Research

Volumn 100, Issue 3, 1997, Pages 594-607

  Hochbaum, Dorit S ^a,b   Pathria, Anu ^a  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Approximation algorithms; Bottleneck optimization problems; Location of facilities; p center

Indexed keywords

EID: 0002391135     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(96)00076-8     Document Type: Article

References (11)

1. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. (1993), Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ.
2. Even, S., Itai, A., and Shamir, A. (1976), "On the complexity of timetable and multicommodity flow problems", SIAM Journal on Computing 5, 691-703.
3. Garey, M.R., and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA.
4. Gonzalez, T.F. (1985), "Clustering to minimize the maximum intercluster distance", Theoretical Computer Science 38/2-3, 293-306.
5. Hwang, R.Z., Lee, R.C.T., and Chang, R.C. (1993), "The slab dividing approach to solve the Euclidean p-Center problem", Algorithmica 9, 1-22.
6. Hochbaum, D.S., and Pathria, A. (1994), "ℒscripy U sign-matchings", Unpublished manuscript.
7. Hochbaum, D.S., and Shmoys, D. (1986), "A unified approach to approximation algorithms for Bottleneck problems", Journal of the Association for Computing Machinery 33/3, 533-550.
8. Hudec, O. (1991), "On alternative p-Center problems", Zeitschrift für Operations Research - Methods and Models of Operations Research 36, 439-445.
9. Karp, R.M. (1972), "Reducibility among combinatorial problems", in: R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 85-103.
10. Kariv, O., and Hakimi, S.L. (1979), "An algorithmic approach to network location problems: The p-Centers", SIAM Journal on Applied Mathematics 3, 513-538.
11. 3 and related problemsℝ, SIAM Journal on Computing 12/4, 759-776.