Abstract
We discuss several forms of thep-center location problems on an undirected tree network. Our approach is based on utilizing results for rigid circuit graphs to obtain polynomial algorithms for solving the model. Duality theory on perfect graphs is used to define and solve the dual location model.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest and R.E. Tarjan, “Time bounds for selection”,Journal of Computer and System Science 7 (1973).
P. Buneman, “A characterization of rigid circuit graphs”,Discrete Mathematics 9 (1974) 205–212.
R. Chandrasekaran and A. Daughety, “Problems of location on trees”, Discussion paper No. 357, Center for Mathematical Studies in Economics and Management, Northwestern University (Evanston, 1978).
P.M. Dearing and R.L. Francis, “A minimax location problem on a network,”Transportation Science 8 (1974) 333–343.
G.A. Dirac, “On rigid circuit graphs”,Abhandlung Mathematics Seminar University of Hamburg 25 (1974) 71–76.
D.R. Fulkerson, “Blocking and anti-blocking pairs of polyhedra”,Mathematical Programming 1 (1971) 168–194.
F. Gavril, “Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph”,SIAM Journal on Computing 1 (1972) 180–187.
A.J. Goldman, “Minimax location of facility in an undirected tree graph”,Transportation Science 6 (1972) 407–418.
S.L. Hakimi, “Optimum locations of switching centers and the absolute centers and medians of a graph”,Operations Research 12 (1964) 450–459.
S.L. Hakimi, E.F. Schmeichel and J.G. Pierce, “Onp-centers in networks”,Transportation Science 12 (1978) 1–15.
G.Y. Handler, “Finding two-centers of a tree: the continuous case”,Transportation Science 12 (1978) 93–106.
G.Y. Handler, “Minimax location of a facility in an undirected tree graph”,Transportation Science 7 (1973) 287–293.
O. Kariv and S.L. Hakimi, “An algorithmic approach to network location problems, part 1: thep-centers”,SIAM Journal on Applied Mathematics 37 (1979) 513–538.
E. Minieka, “Them-center problem”,SIAM Review 12 (1970) 138–139.
M.W. Padberg, “Perfect zero–one matrices”,Mathematical Programming 6 (1974) 180–196.
D.J. Rose, R.E. Tarjan and G.S. Lueken, “Algorithmic aspects of vertex elimination on graphs”,SIAM Journal on Computing 5 (1976) 266–283.
D.R. Shier, “A min—max theorem forp-center problems on a tree”,Transportation Science 11 (1977) 243–252.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Chandrasekaran, R., Tamir, A. Polynomially bounded algorithms for locatingp-centers on a tree. Mathematical Programming 22, 304–315 (1982). https://doi.org/10.1007/BF01581045
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581045