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

The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. the p-median problem is to locate p facilities on a network so as to minimize the average distance from one of the n demand points to one of the p facilities. We provide, given the interval model of an n vertex interval graph, an O(n) time algorithm for the 1-median problem on the interval graph. We also show how to solve the p-median problem, for arbitrary p, on an interval graph in O(pn log n) time and on an circular-arc graph in O(pn2 log n) time. other than for trees, no polynomial time algorithm for p-median problem has been reported for any large class of graphs. We introduce a spring model of computation and show how to solve the p-center problem on an circular-arc graph in O(pn) time, assuming that the arc endpoints are sorted.

[1]  Dominique Peeters,et al.  Location on networks , 1992 .

[2]  Kellogg S. Booth,et al.  Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[3]  Stephan Olariu,et al.  A simple linear-time algorithm for computing the center of an interval graph , 1990, Int. J. Comput. Math..

[4]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[5]  Zvi Galil,et al.  A Linear-Time Algorithm for Concave One-Dimensional Dynamic Programming , 1990, Inf. Process. Lett..

[6]  Refael Hassin,et al.  Improved complexity bounds for location problems on the real line , 1991, Oper. Res. Lett..

[7]  M. Klawe.  A Simple Linear Time Algorithm for Concave One-Dimensional Dynamic Programming , 1989 .

[8]  M. Brandeau,et al.  An overview of representative problems in location research , 1989 .

[9]  Greg N. Frederickson,et al.  Parametric Search and Locating Supply Centers in Trees , 1991, WADS.

[10]  Edward M. McCreight,et al.  Priority Search Trees , 1985, SIAM J. Comput..

[11]  C. Pandu Rangan,et al.  An optimal algorithm to solve the all-pair shortest path problem on interval graphs , 1992, Networks.

[12]  Judit Bar-Ilan,et al.  Approximation Algorithms for Selecting Network Centers (Preliminary Vesion) , 1991, WADS.

[13]  Dominique Peeters,et al.  Chapter 7 Location on networks , 1995 .

[14]  Bezalel Gavish,et al.  Computing the 2-median on tree networks in O(n lg n) time , 1995, Networks.

[15]  Arie Tamir,et al.  An O(pn2) algorithm for the p-median and related problems on tree graphs , 1996, Oper. Res. Lett..

[16]  Timothy J. Lowe,et al.  Location on Networks: A Survey. Part I: The p-Center and p-Median Problems , 1983 .

[17]  O. Kariv,et al.  An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .

[18]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[19]  Rolf H. Möhring,et al.  Graph Problems Related to Gate Matrix Layout and PLA Folding , 1990 .

[20]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[21]  Der-Tsai Lee,et al.  Solving the all-pair shortest path query problem on interval and circular-arc graphs , 1998 .

[22]  Mimmo Parente,et al.  Dynamic and Static Algorithms for Optimal Placement of Resources in a Tree , 1996, Theor. Comput. Sci..