$k$-PCA for (non-squared) Euclidean Distances: Polynomial Time Approximation

Documenti analoghi

• Faster Approximation Scheme for Euclidean $k$-TSP
  di: van Wijland, Ernest, et al.
  Pubblicazione: (2023)
• Parameterized Approximation for Robust Clustering in Discrete Geometric Spaces
  di: Abbasi, Fateme, et al.
  Pubblicazione: (2023)
• Constant Approximation of Fréchet Distance in Strongly Subquadratic Time
  di: Cheng, Siu-Wing, et al.
  Pubblicazione: (2025)
• On Optimal Coreset Construction for Euclidean $(k,z)$-Clustering
  di: Huang, Lingxiao, et al.
  Pubblicazione: (2022)
• Improved Learning via k-DTW: A Novel Dissimilarity Measure for Curves
  di: Krivošija, Amer, et al.
  Pubblicazione: (2025)