Minimum-diameter covering problems

Networks

Volumn 36, Issue 3, 2000, Pages 147-155

  Arkin, Esther M ^a   Hassin, Refael ^b  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Covering problems; Graph diameter; NP complete

Indexed keywords

EID: 0034288913     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-0037(200010)36:3<147::AID-NET1>3.0.CO;2-M     Document Type: Article

References (20)

1. [1] E.M. Arkin, M.M. Halldórson, and R. Hassin, Approximating the tree and tour covers of a graph, Info Proc Lett 47 (1993), 275-282.
2. [2] M. Benelli and R. Hassin, Optimal separable partitioning in the plane, Discr Appl Math 59 (1995), 215-224.
3. [3] P. Brucker, "On the complexity of clustering problems," Optimization and operations research, Lecture notes in economics and mathematical systems 157, R. Henn, B. Korte, and W. Oettli (Editors), Springer, New York, 1977.
4. [4] S. Even, A. Itai, and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J Comput 5 (1976), 691-703.
5. [5] H.N. Gabow, S.N. Maheshwari, and L.J. Osterweil, On two problems in the generation of program test paths, IEEE Trans Software Eng SE-2 (1976), 227-231.
6. [6] M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, Freeman, San Francisco, 1979.
7. [7] T. Gonzalez, Clustering to minimize the maximum intercluster distance, Theor Comput Sci 38 (1985), 293-306.
8. [8] D. Hochbaum and A. Pathria, Generalized p-center problems: Complexity results and approximation algorithms, Eur J Oper Res 3 (1997), 594-607.
9. [9] D. Hochbaum and D. Shmoys, A unified approach to approximation algorithms for bottleneck problems, J Assoc Comput Machin 33 (1986), 533-550.
10. [10] O. Hudec, On alternative p-center problems, ZOR - Methods Models Oper Res 36 (1991), 439-445.
11. [11] A. Itai, M. Rodeh, and S.L. Tanimoto, Some matching problems for bipartite graphs, J Assoc Comput Machin 25 (1978), 517-525.
12. [12] D.S. Johnson, The NP-completeness column: An ongoing guide, J Alg 3 (1982). 182-195.
13. [13] D.S. Johnson and C.H. Papadimitriou, "Performance guarantees for heuristics," The traveling salesman problem, E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys (Editors), Wiley, Chichester, 1985, Chapter 5.
14. [14] E.L. Lawler, Fast approximation algorithms for knapsack problems, Math Oper Res 4 (1979), 339-356.
15. 3, SIAM J Comput 12 (1983), 759-776.
16. [16] C. Monma and S. Suri, Partitioning points and graphs to minimize the maximum or the sum of diameters, Proc Sixth International Conf on the Theory and Applications of Graphs, Wiley, New York, 1988.
17. [17] F.P. Preparata and M.I. Shamos, Computational geometry: An introduction, Springer-Verlag, New York, 1985.
18. [18] S. Sarin and M.H. Karwan, The linear multiple-choice knapsack problem, Oper Res Lett 8 (1989), 95-100.
19. [19] P. Sinha and A.A. Zoltners, The multiple-choice knapsack problem, Oper Res 27 (1979), 503-515.
20. [20] A. Tamir, Obnoxious facility location on graphs, SIAM J Discr Math 4 (1991), 550-567.