Document Type
Technical Report
Publication Date
2-10-2021
Technical Report Number
TR2021-1001
Faculty Approver
Deeparnab Chakrabarty
Abstract
An instance of the k-center problem consists of n points in a metric space along with a positive integer k. The goal is to find the smallest radius r such that there exists a subset of k centers picked among them such that every point is within distance r of at least one center. Stuart Mentzer (Mentzer, 1988) wrote a paper showing that in the Euclidean plane, it is NP-Hard to approximate this problem up to a factor of √2 +√3 ≈ 1.93. However, his report is missing some details. In this note, we present details of his full construction.
Dartmouth Digital Commons Citation
Chen, Raymond, "On Mentzer’s Hardness of the k-Center Problem on the Euclidean Plane." (2021). Computer Science Technical Report TR2021-1001. https://digitalcommons.dartmouth.edu/cs_tr/383
