Algorithms for central-median paths with bounded length on trees

Abstract The location of path-shaped facilities on trees has been receiving a growing attention in the specialized literature in the recent years. Examples of such facilities include railroad lines, highways and public transit lines. Most of the papers deal with the problem of locating a path on a tree by minimizing either the maximum distance from the vertices of the tree to the facility or of minimizing the sum of the distances from all the vertices of the tree to the path. However, neither of the two above criteria alone capture all essential elements of a location problem. The sum of the distances criterion alone may result in solutions which are unacceptable from the point of view of the service level for the clients who are located far away from the facilities. On the other hand, the criterion of the minimization of the maximum distance, if used alone, may lead to very costly service systems. In the literature, there is just one paper that considers the problem of finding an optimal location of a path on a tree using combinations of the two above criteria, and efficient algorithms are provided. In particular, the cases where one criterion is optimized subject to a restriction on the value of the other are considered and linear time algorithms are presented. However, these problems do not consider any bound on the length or cost of the facility. In this paper we consider the two following problems: find a path which minimizes the sum of the distances such that the maximum distance from the vertices of the tree to the path is bounded by a fixed constant and such that the length of the path is not greater than a fixed value; find a path which minimizes the maximum distance with the sum of the distances being not greater than a fixed value and with bounded length. From an application point of view the constraint on the length of the path may refer to a budget constraint for establishing the facility. The restriction on the length of the path complicates the two problems but for both of them we give O( n  log 2 n ) divide-and-conquer algorithms.

[1]  A. Tamir,et al.  A polynomial algorithm for the p-centdian problem on a tree , 1998, Networks.

[2]  Justo Puerto,et al.  Conditional location of path and tree shaped facilities on trees , 2005, J. Algorithms.

[3]  Mikkel Thorup,et al.  Finding Cores of Limited Length , 1997, WADS.

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

[5]  P. Slater.  Locating Central Paths in a Graph , 1982 .

[6]  S. M. Hedetniemi,et al.  Linear Algorithms for Finding the Jordan Center and Path Center of a Tree , 1981 .

[7]  Ronald I. Becker,et al.  The Cent-dian Path Problem on Tree Networks , 2001, ISAAC.

[8]  Oded Berman,et al.  Algorithms for path medi-centers of a tree , 1999, Comput. Oper. Res..

[9]  Biing-Feng Wang.  Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network , 2000, J. Algorithms.

[10]  Shietung Peng,et al.  Efficient Algorithms for Finding a Core of a Tree with a Specified Length , 1996, J. Algorithms.

[11]  Chi-Jen Lu,et al.  Efficient Algorithms for Two Generalized 2-Median Problems on Trees , 2009, ISAAC.

[12]  Biing-Feng Wang,et al.  The Conditional Location of a Median Path , 2002, COCOON.

[13]  Timothy J. Lowe,et al.  On the location of a tree-shaped facility , 1996, Networks.

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

[15]  J. Halpern.  Finding Minimal Center-Median Convex Combination Cent-Dian of a Graph , 1978 .

[16]  Peter J. Slater,et al.  A Linear Algorithm for a Core of a Tree , 1980, J. Algorithms.

[17]  Edward Minieka.  The optimal location of a path or tree in a tree network , 1985, Networks.

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

[19]  Jonathan Halpern,et al.  THE LOCATION OF A CENTER-MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE* , 1976 .

[20]  S. Halfin.  Letter to the Editor—On Finding the Absolute and Vertex Centers of a Tree with Distances , 1974 .

[21]  George L. Nemhauser,et al.  Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .

[22]  INDUCTIVE ALGORITHMS ON FINITE TREES , 1990 .

[23]  Juan A. Mesa,et al.  A review of extensive facility location in networks , 1996 .

[24]  Ronald I. Becker,et al.  Finding the l-core of a tree , 2002, Discret. Appl. Math..

[25]  Martine Labbé,et al.  On locating path- or tree-shaped facilities on networks , 1993, Networks.

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

[27]  G. Handler.  Minimax Location of a Facility in an Undirected Tree Graph , 1973 .

[28]  Peter J. Slater.  On Locating a Facility to Service Areas within a Network , 1981, Oper. Res..

[29]  Gabriel Y. Handler,et al.  Medi-Centers of a Tree , 1985, Transp. Sci..