Clustering with Internal Connectedness
From MaRDI portal
Publication:3078394
DOI10.1007/978-3-642-19094-0_17zbMath1317.68279OpenAlexW1604056673MaRDI QIDQ3078394
Aditya Pancholi, Yogish Sabharwal, Neelima Gupta
Publication date: 20 February 2011
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19094-0_17
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- On the Complexity of Some Common Geometric Location Problems
- Linear-time approximation schemes for clustering problems in any dimensions
- On coresets for k-means and k-median clustering
- On k-Median clustering in high dimensions
- A General Approximation Technique for Constrained Forest Problems
This page was built for publication: Clustering with Internal Connectedness
