Fine-Grained Complexity of Continuous Euclidean k-Center
Open Access
- 9 June 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 330-341
Abstract
No abstract availableAll Related Versions
Funding Information
- National Science Foundation (CCF-2313372)
- National Science Foundation (CCF-2443697)
- National Science Foundation (CCF-2517033)
- National Science Foundation (CCF-2237288)
- Deutsche Forschungsgemeinschaft (459420781)
- European Research Council (850979)
This publication has 31 references indexed in Scilit:
- The Parameterized Hardness of the k-Center Problem in Transportation NetworksAlgorithmica, 2020
- Fundamentals of Parameterized Complexity2013
- Efficient Approximation Schemes for Geometric Problems?2005
- Exact and Approximation Algorithms for ClusteringAlgorithmica, 2002
- Which Problems Have Strongly Exponential Complexity?Journal of Computer and System Sciences, 2001
- On the Complexity of k-SATJournal of Computer and System Sciences, 2001
- The Discrete 2-Center ProblemDiscrete & Computational Geometry, 1998
- A Near-Linear Algorithm for the Planar 2-Center ProblemDiscrete & Computational Geometry, 1997
- Planar geometric location problemsAlgorithmica, 1994
- The slab dividing approach to solve the EuclideanP-Center problemAlgorithmica, 1993