Abstract
We consider maximumb-matching problems where the nodes of the graph represent points in a metric space, and the weight of an edge is the distance between the respective pair of points. We show that if the space is either the rectilinear plane, or the metric space induced by a tree network, then theb-matching problem is the dual of the (single) median location problem with respect to the given set of points. This result does not hold for the Euclidean plane. However, we show that in this case theb-matching problem is the dual of a median location problem with respect to the given set of points, in some extended metric space. We then extend this latter result to any geodesic metric in the plane. The above results imply that the respective fractionalb-matching problems have integer optimal solutions. We use these duality results to prove the nonemptiness of the core of a cooperative game defined on the roommate problem corresponding to the above matching model. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. Alt and E. Welzl, Visibility graphs and obstacle-avoiding shortest paths,Zeitschrift für Operations Research 32 (1988) 145–164.
R.P. Anstee, A polynomial algorithm forb-matchings: An alternative approach,Information Processing Letters 24 (1987) 153–157.
J. Bartholdi and M.A. Trick, Stable matching with preferences derived from psychological model,Operations Research Letters 5 (1986) 165–169.
W. Cook and W.R. Pulleyblank, Linear systems for constrained matching problems,Mathematics of Operations Research 12 (1987) 97–120.
W.H. Cunningham and A.B. Marsh III, A primal algorithm for optimum matching,Mathematical Programming Study 8 (1978) 50–72.
E. Erkut, R.L. Francis, T.J. Lowe and A. Tamir, Equivalent mathematical programming formulations of tree network location problems,Operations Research 37 (1989) 447–461.
D. Gale and L.S. Shapley, College admissions and the stability of marriage,American Mathematical Monthly 69 (1962) 9–14.
O. Gerstel and S. Zaks, A new characterization of tree medians with applications to distributed sorting,Networks 24 (1994) 23–39.
A.J. Goldman, Optimal center location in simple networks,Transportation Science 5 (1971) 212–221.
D. Granot, A note on the roommates problem and a related revenue allocation problem,Management Science 30 (1984) 633–643.
D. Gusfield and R.W. Irving,The Stable Marriage Problem (MIT Press, Cambridge, MA, 1989).
J. Hershberger and S. Suri, Matrix searching with the shortest path metric,Proceedings of the 25th Annal ACM Symposium on Theory of Computing (1993) 485–494.
A.N.C. Kang and D.A. Ault, Some properties of a centroid of a free tree,Information Processing Letters 4 (1975) 18–20.
O. Kariv and L.S. Hakimi, An algorithmic approach to network location problems. II: The p-medians,SIAM Journal on Applied Mathematics 37 (1979) 539–560.
M. Katchalski and H. Last, Disjoint edges in convex position in a geometric graph, in:4th Israeli Workshop on Computational and Combinatorial Geometry, Eilat, Israel, 1995.
Y.S. Kupitz, Extremal problems in combinatorial geometry, M.Sc. Thesis, Aarhus University Lecture Notes Series, Vol. 53, 1979.
Y.S. Kupitz, On pairs of disjoint segments in convex position in the plane,Annals of Discrete Mathematics 20 (1984) 203–208.
H. Last, Turan Type problems for geometric graphs, M.Sc. Thesis, Technion, Israel Institute of Technology, 1994 (in Hebrew).
E. Lawler,Combinatorial Optimization: Networks and Matroids (Holt, Rinehart and Winston, New York, 1976).
L. Lovasz and M.D. Plummer,Matching Theory, Annals of Discrete Mathematics, Vol. 29 (North-Holland, Amsterdam, 1986).
O. Marcotte and S. Suri, Fast matching algorithms for points on a polygon,SIAM Journal on Computing 20 (1991) 405–422.
G. Owen, On the core of linear production games,Mathematical Programming 9 (1975) 358–370.
W.R. Pulleyblank, Faces of matching polyhedra, Ph.D. Thesis, University of Waterloo, Department of Combinatorics and Optimization, 1973.
G. Sabidussi, The centrality index of a graph,Psychometrika 31 (1966) 58–603.
P. Vaidya, Geometry helps in matching,SIAM Journal on Computing 18 (1989) 1201–1225.
B. Zelinka, Medians and peripherians of trees,Archivum Mathematicum (Brno) 4 (1968) 87–95.
Author information
Authors and Affiliations
Additional information
Corresponding author.
Rights and permissions
About this article
Cite this article
Tamir, A., Mitchell, J.S.B. A maximumb-matching problem arising from median location models with applications to the roommates problem. Mathematical Programming 80, 171–194 (1998). https://doi.org/10.1007/BF01581725
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581725