Coresets-Methods and History: A Theoreticians Design Pattern for Approximation and Streaming Algorithms
Open Access
- 19 December 2017
- journal article
- research article
- Published by Springer Nature in KI - Künstliche Intelligenz
- Vol. 32 (1) , 37-53
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (DE) (SFB 876, C4)
- Deutsche Forschungsgemeinschaft (SFB 876, A2)
This publication has 66 references indexed in Scilit:
- Coresets, sparse greedy approximation, and the Frank-Wolfe algorithmACM Transactions on Algorithms, 2010
- Clustering for metric and nonmetric distance measuresACM Transactions on Algorithms, 2010
- An Almost Space-Optimal Streaming Algorithm for Coresets in Fixed DimensionsAlgorithmica, 2010
- Linear-time approximation schemes for clustering problems in any dimensionsJournal of the ACM, 2010
- Smaller Coresets for k-Median and k-Means ClusteringDiscrete & Computational Geometry, 2006
- Faster core-set constructions and data-stream algorithms in fixed dimensionsComputational Geometry, 2006
- Approximating extent measures of pointsJournal of the ACM, 2004
- A local search approximation algorithm for k-means clusteringComputational Geometry, 2004
- Lower bounds for one-way probabilistic communication complexity and their application to space complexityTheoretical Computer Science, 1996
- Decomposable searching problems I. Static-to-dynamic transformationJournal of Algorithms, 1980