Fine-Grained Complexity of Continuous Euclidean k-Center

Documenti analoghi

• On connections between k-coloring and Euclidean k-means
  di: Aman, Enver, et al.
  Pubblicazione: (2024)
• Near-Optimal Bounds for Parameterized Euclidean k-means
  di: Cohen-Addad, Vincent, et al.
  Pubblicazione: (2026)
• Complexity of Local Search for Euclidean Clustering Problems
  di: Manthey, Bodo, et al.
  Pubblicazione: (2023)
• The Fine-Grained Complexity of Episode Matching
  di: Bille, Philip, et al.
  Pubblicazione: (2021)
• On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
  di: S., Karthik C., et al.
  Pubblicazione: (2024)