Papers
Topics
Authors
Recent
Search
2000 character limit reached

Euclidean Maximum Matchings in the Plane---Local to Global

Published 30 May 2024 in cs.CG and cs.DM | (2405.20424v1)

Abstract: Let MM be a perfect matching on a set of points in the plane where every edge is a line segment between two points. We say that MM is globally maximum if it is a maximum-length matching on all points. We say that MM is kk-local maximum if for any subset M′={a1b1,…,akbk}M'=\{a_1b_1,\dots,a_kb_k\} of kk edges of MM it holds that M′M' is a maximum-length matching on points {a1,b1,…,ak,bk}\{a_1,b_1,\dots,a_k,b_k\}. We show that local maximum matchings are good approximations of global ones. Let μk\mu_k be the infimum ratio of the length of any kk-local maximum matching to the length of any global maximum matching, over all finite point sets in the Euclidean plane. It is known that μk⩾k−1k\mu_k\geqslant \frac{k-1}{k} for any k⩾2k\geqslant 2. We show the following improved bounds for k∈{2,3}k\in\{2,3\}: 3/7⩽μ2<0.93\sqrt{3/7}\leqslant\mu_2< 0.93 and 3/2⩽μ3<0.98\sqrt{3}/2\leqslant\mu_3< 0.98. We also show that every pairwise crossing matching is unique and it is globally maximum. Towards our proof of the lower bound for μ2\mu_2 we show the following result which is of independent interest: If we increase the radii of pairwise intersecting disks by factor 2/32/\sqrt{3}, then the resulting disks have a common intersection.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Tweets

Sign up for free to view the 1 tweet with 1 like about this paper.