2000 character limit reached
Augmenting a Geometric Matching is $NP$-complete
Published 27 Jun 2012 in cs.CC and cs.CG | (1206.6360v1)
Abstract: Given $2n$ points in the plane, it is well-known that there always exists a perfect straight-line non-crossing matching. We show that it is $NP$-complete to decide if a partial matching can be augmented to a perfect one, via a reduction from 1-in-3-SAT. This result also holds for bichromatic matchings.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
