Approximation schemes for Min-Sum \(k\)-Clustering
From MaRDI portal
Publication:6670503
DOI10.1016/J.DISOPT.2024.100860MaRDI QIDQ6670503
Ismail Naderi, Mohsen Rezapour, Mohammad Salavatipour
Publication date: 23 January 2025
Published in: Discrete Optimization (Search for Journal in Brave)
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for min-sum \(k\)-clustering and balanced \(k\)-median
- Approximation algorithms for min-sum \(p\)-clustering
- Bypassing the embedding
- Approximation schemes for clustering problems
- Small Space Representations for Metric Min-Sum k-Clustering and Their Applications
- P-Complete Approximation Problems
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
- Approximating min-sum k -clustering in metric spaces
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs
This page was built for publication: Approximation schemes for Min-Sum \(k\)-Clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6670503)
