On connections between k-coloring and Euclidean k-means

Documenti analoghi

• Near-Optimal Bounds for Parameterized Euclidean k-means
  di: Cohen-Addad, Vincent, et al.
  Pubblicazione: (2026)
• Fine-Grained Complexity of Continuous Euclidean k-Center
  di: Blank, Lotte, et al.
  Pubblicazione: (2026)
• Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
  di: Cohen-Addad, Vincent, et al.
  Pubblicazione: (2026)
• On Equivalence of Parameterized Inapproximability of k-Median, k-Max-Coverage, and 2-CSP
  di: S., Karthik C., et al.
  Pubblicazione: (2024)
• Recognizing 2-Layer and Outer $k$-Planar Graphs
  di: Kobayashi, Yasuaki, et al.
  Pubblicazione: (2024)