Abstract.
For any [Formula: see text], we prove that [Formula: see text]-Dimensional Matching is hard to approximate within a factor of [Formula: see text] for large [Formula: see text] unless [Formula: see text]. Listed in Karp’s 21 [Formula: see text]-complete problems, [Formula: see text]-Dimensional Matching is a...
Euiwoong Lee, Ola Svensson, Theophile Thiery· SIAM journal on computing (P...· 0 citations
Metric $k$-minsum clustering is a simple, natural, appealing density-based clustering criterion whose computational complexity remains poorly understood, despite the progress achieved fornother clustering criteria in the past three decades. In this paper we give an efficient approximation scheme for this problem that r...
S. KarthikC, Euiwoong Lee, Y. Rabani et al.· 0 citations
This work presents a nontrivial modification of the Greedy algorithm that operates with only [Formula: see text] adaptive phases and develops a novel [Formula: see text]-approximation algorithm tailored for stable instances, where removing any center from an optimal solution increases the cost by at least an [Formula:...
Vincent Cohen-Addad, Fabrizio Grandoni, Euiwoong Lee et al.· SIAM journal on computing (P...· 0 citations
A new dual fitting algorithm is given which tightly accounts for dual payments while still facilitating an effective dual feasibility analysis, and a new framework that uses spectral analysis for determining the approximation factor of the algorithm is introduced.
Aditya Anand, Moses Charikar, Vincent Cohen-Addad et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.