Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs

Networks

Volumn 39, Issue 3, 2002, Pages 144-152

  Bespamyatnikh, Sergei ^a   Bhattacharya, Binay ^b   Keil, Mark ^c   Kirkpatrick, David ^d   Segal, Michael ^e  

^a Duke University   (United States)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF SASKATCHEWAN   (Canada)

^d UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^e BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Interval and circular arc graphs; p centers; p medians

Indexed keywords

ALGORITHMS; FUNCTIONS; GRAPH THEORY; PROBLEM SOLVING;

CIRCULAR-ARC GRAPHS;

TELECOMMUNICATION NETWORKS;

EID: 0141540727     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/net.10023     Document Type: Article

References (32)

1. V. Auletta, D. Parente, and G. Persiano, Dynamic and static algorithms for the optimal placement of resources in a tree, Theor Comput Sci 165 (1996), 441-461.
2. J. Bar-Ilan and D. Peleg, Approximation algorithms for selecting network centers, Proc Workshop on Algorithms and Data Structures'91 1991, pp. 343-354.
3. K.S. Booth and G.S. Leuker, Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms, J Comput Syst Sci 13 (1976), 335-379.
4. M.L. Brandeau and S.S. Chiu, An overview of representative problems in location research, Mgmt Sci 35 (1989), 645-674.
5. M. Charikar and S. Guha, Improved combinatorial algorithms for the facility location and k-median problems, Proc 40th Ann Symp on Foundations of Computer Science, 1999, pp. 378-388.
6. M. Charikar, S. Guha, E. Tardos, and D.B. Shmoys, A constant factor approximation for the k-median problem, Proc 31th Ann ACM Symp on Theory of Computing, 1999, pp. 1-10.
7. D. Chen, D.T. Lee, R. Sridhar, and C. Sekharam, Solving the all-pair shortest path query problem on interval and circular-arc graphs, Networks 31, 1998, 249-258.
8. G. Frederickson, Parametric search and locating supply centers in trees, Proc Workshop on Algorithms and Data Structures'91 1991, pp. 299-319.
9. Z. Galil and K. Park, A linear-time algorithm for concave one-dimensional dynamic programming, Info Process Lett 33 (1990), 309-311.
10. B. Gavish and S. Sridhar, Computing the 2-median on tree networks in O(n log n) time, Networks 26 (1995), 305-317.
11. A.J. Goldman, Optimal center location in simple networks, Trans Sci 5 (1971), 212-221.
12. M.C. Golumbic, Algorithmic graph theory and perfect graphs, Academic Press, New York, 1980.
13. D. Granot and D. Skorin-Kapov, On some optimization problems on k-trees and partial k-trees, Discr Appl Math 48 (1994), 129-145.
14. S.L. Hakimi, Optimal locations of switching centers and the absolute centers and medians of a graph, Oper Res 12 (1964), 450-459.
15. R. Hassin and A. Tamir, Efficient algorithms for optimization and selection in series-parallel graphs, SIAM J Alg Discr Methods 7 (1986), 379-389.
16. R. Hassin and A. Tamir, Improved complexity bounds for location problems on the real line, Oper Res Lett 10 (1991), 395-402.
17. D. Hochbaum and D.B. Shmoys, A unified approach to approximation algorithms for bottle neck problems, JACM 33 (1986), 533-550.
18. V.N. Hsu, T.J. Lowe, and A. Tamir, Structured p-facility location problems on the line solvable in polynomial time, Oper Res Lett 21 (1997), 159-164.
19. K. Jain and V.V. Vazirani, Primal-dual approximation algorithms for metric facility location and k-median problems, Proc 40th Ann Symp on Foundations of Computer Science, 1999, pp. 2-13.
20. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems I: The p-centers, SIAM J Appl Math 37 (1979), 514-538.
21. O. Kariv and S.L. Hakimi, An algorithmic approach to network location problems II: The p-medians, SIAM J Appl Math 37 (1979), 539-560.
22. M. Klawe, A simple linear time algorithm for concave one-dimensional dynamic programming, Technical report 89-16, University of British Columbia, Vancouver, 1989.
23. A. Kolen and A. Tamir, "Covering problems," Discrete Location Theory, P. Mirchandani and R. Francis (Editors), Wiley, New York, 1990, pp. 263-304.
24. M. Labbe, D. Peeters, and J.F. Thisse, "Location on networks," Handbooks in Operations Research and Management Science, M. Ball, T. Magnanti, and R. L. Francis (Editors), Elsevier, Amsterdam, 1995, Vol. 8.
25. E.M. McCreight, Priority search trees, SIAM J Comput 14 (1985), 257-276.
26. P. Mirchandani, "The p-median problem and generalizations," Discrete Location Theory, P. B. Mirchandani and R. L. Francis (Editors), Wiley, New York, 1990, pp. 55-117.
27. R. Mohring, "Graph problems related to gate matrix layout and PLA folding," Computational Graph Theory, G. Tinhofer, E. Mayr, H. Noltemeir and M. Syslo (Editors), Springer-Verlag, New York, 1990, pp. 17-51.
28. S. Olariu, "A simple linear-time algorithm for computing the center of an interval graph," Int J Comput Math 24 (1990), 121-128.
29. R. Ravi, M. Marathe, and C. Rangan, An optimal algorithm to solve the all-pair shortest path problem on interval graphs, Networks 22 (1992), 21-35.
30. A. Tamir, Improved complexity bounds for center location problems on networks by using dynamic data structures, SIAM J Discr Math 1 (1988), 377-396.
31. 2) algorithm for the p-median and related problems on tree graphs, Oper Res Lett 19 (1996), 59-64.
32. B.C. Tansel, R.L. Francis, and T.J. Lowe, Location on networks: A survey - Part I: The p-center and p-median problems, Mgmt Sci 29 (1983), 482-497.