Conditional location of path and tree shaped facilities on trees

In this paper we deal with the location of extensive facilities on trees, both discrete and continuous, under the condition that existing facilities are already located. We require that the selected new server is a subtree, although we also specialize to the case of paths. We study the problem with the two most widely used criteria in Location Analysis: center and median. Our main results under the center criterion are nestedness properties of the solution and subquadratic algorithms for the location of paths and subtrees. For the case of the median criterion we prove that unlike the case where there is no existing facility, the continuous conditional median subtree problem is NP-hard and we develop a corresponding fully polynomial approximation algorithm. We also present subquadratic algorithms for almost all other models.

[1]  Justo Puerto,et al.  The centdian subtree on tree networks , 2002, Discret. Appl. Math..

[2]  Amedeo R. Odoni,et al.  Locating new passenger facilities on a transportation network , 1979 .

[3]  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.

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

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

[6]  Zvi Drezner,et al.  On the conditional p-median problem , 1995, Comput. Oper. Res..

[7]  John Hershberger,et al.  Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..

[8]  Edward Minieka,et al.  Conditional centers and medians of a graph , 1980, Networks.

[9]  Reuven Chen,et al.  Conditional Minisum and Minimax Location-Allocation Problems in Euclidean Space , 1988, Transp. Sci..

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

[11]  Pierre Hansen,et al.  The continuous p-median of a network , 1989, Networks.

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

[13]  N. S. Barnett,et al.  Private communication , 1969 .

[14]  Maiko Shigeno,et al.  The tree center problems and the relationship with the bottleneck knapsack problems , 1997 .

[15]  Timothy J. Lowe,et al.  Distance Constraints for Tree Network Multifacility Location Problems , 1978, Oper. Res..

[16]  Yehoshua Perl,et al.  Finding the two-core of a tree , 1985, Discret. Appl. Math..

[17]  Donald B. Johnson,et al.  Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures , 1983, J. Algorithms.

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

[19]  Jörg-Rüdiger Sack,et al.  Algorithms and Data Structures , 2002, Lecture Notes in Computer Science.

[20]  David Simchi-Levi,et al.  Technical Note - Conditional Location Problems on Networks , 1990, Transp. Sci..

[21]  Arie Tamir,et al.  Fully Polynomial Approximation Schemes for Locating a Tree-shaped Facility: a Generalization of the Knapsack Problem , 1998, Discret. Appl. Math..

[22]  Timothy J. Lowe,et al.  The generalized P-forest problem on a tree network , 1992, Networks.

[23]  Zvi Drezner.  Conditional p-Center Problems , 1989, Transp. Sci..

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

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

[26]  Maiko Shigeno,et al.  The tree center problems and the relationship with the bottleneck knapsack problems , 1997, Networks.

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

[28]  Edward Minieka,et al.  On Finding the Core of a Tree with a Specified Length , 1983, J. Algorithms.

[29]  Biing-Feng Wang.  Finding a 2-Core of a Tree in Linear Time , 2002, SIAM J. Discret. Math..

[30]  Biing-Feng Wang,et al.  Finding a Two-Core of a Tree in Linear Time , 2000, ISAAC.

[31]  Shietung Peng,et al.  Algorithms for a Core and k-Tree Core of a Tree , 1993, J. Algorithms.

[32]  Nimrod Megiddo,et al.  An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..

[33]  Micha Sharir,et al.  Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.

[34]  Sartaj Sahni,et al.  General Techniques for Combinatorial Approximation , 1977, Oper. Res..

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

[36]  Reuven Chen,et al.  The conditional p‐center problem in the plane , 1993 .

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