A Technical Report on PLS-Completeness of Single-Swap for Unweighted Metric Facility Location and K-Means
Abstract
Recently, [Bra17] showed that the single-swap heuristic for weighted metric uncapacitated facility location and K-Means is tightly PLS-complete. We build upon this work and present a stronger reduction, which proves tight PLS-completeness for the unweighted version of both problems.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.