An O(pn2 ) algorithm for the p-median and related problems on tree graphs

Operations Research Letters

Volumn 19, Issue 2, 1996, Pages 59-64

  Tamir, Arie ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Facility location; p coverage problems; p median problems; Tree graphs

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; GRAPH THEORY; MATHEMATICAL MODELS; OPERATIONS RESEARCH; PROBLEM SOLVING; TREES (MATHEMATICS);

COMPLEXITY BOUND; FACILITY LOCATION; LEAVES TO ROOT DYNAMIC PROGRAMMING; P COVERAGE PROBLEMS; P MEDIAN PROBLEMS; TREE GRAPHS;

ALGORITHMS;

EID: 0030216223     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/0167-6377(96)00021-1     Document Type: Article

References (13)

1. G. Comuejols, G.L. Nemhauser and L.A. Wolsey, "The uncapacitated facility location problem", in: P.B. Mirchandani and R.L. Francis (eds.), Discrete Location Theory, Wiley, New York, 1990, pp. 119-171.
2. U. Faigle and W. Kern, "Computational complexity of some maximum average weight problems with precedence constraints", Oper. Res. 42, 688-693 (1994).
3. M. Fischetti, H.W. Harnacher, K. Jornsten and F. Maffioli, "Weighted k-cardinality trees: complexity and polyhedral structure", Networks 24, 11-21 (1994).
4. M.M. Halldórsson, K. Iwano, N. Katoh and T. Tokuyama, "Finding subsets maximizing minimum structures", in: Proc. 6th Ann. ACM-SIAM symp. on Discrete Algorithms, San Francisco, California, 1995, pp. 150-159.
5. R. Hassin and A. Tamir, "Improved complexity bounds for location problems on the real line", Oper. Res. Lett. 10, 395-402 (1991).
6. W.L. Hsu, "The distance-domination numbers of trees", Oper. Res. Lett. 1, 96-100 (1982).
7. D.S. Johnson and K.A. Niemi, "On knapsack, partitions, and a new dynamic programming technique for trees", Math. Oper. Res. 8, 1-14 (1983).
8. O. Kariv and S.L. Hakimi, "An algorithmic approach to network location problems, Part II: p-medians", SIAM J. Appl. Math. 37, 539-560 (1979).
9. T.U. Kim, T.J. Lowe, A. Tamir and J.E. Ward, "On the location of a tree shaped facility", Networks, to appear.
10. J.-H. Lin and J.S. Vitter, "Approximations with minimum packing constraint violation", CS 92-29, Department of Computer Science, Brown University, 1992.
11. F. Maffioli, "Finding a best subtree of a tree", Report No. 91.041, Dipartimento Di Elettronica, Politecnico Di Milano, 1991.
12. N. Megiddo, E. Zemel and S.L. Hakimi, "The maximum coverage location problem", SIAM J. Algebraic Discrete Methods 4, 253-261 (1983).
13. A. Tamir and T.J. Lowe, "The generalized p-forest problem on a tree network", Networks 22, 217-230 (1992).