FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

DOI10.1007/B104325MaRDI QIDQ5465864zbMATH OpenOpenAlexFDO

Authors Sariel Har-Peled

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b104325

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Approximation algorithms for projective clustering
• A space-optimal data-stream algorithm for coresets in the plane
• scientific article; zbMATH DE number 2079414
• Dynamic coresets

Cited in

(9)

• Aggregation error for location models: Survey and analysis
• A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem
• Core-sets: updated survey
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Mathematical Programming Formulations for the Bottleneck Hyperplane Clustering Problem
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Turning big data into tiny data: coresets for unsupervised learning problems
• Fully scalable MPC algorithms for Euclidean k-center
• Dynamic coresets

This page was built for publication: FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465864)