Approximation algorithms for some clustering and classification problems

DOI10.1007/3-540-46632-0_19MaRDI QIDQ2729096zbMATH OpenFDO

Authors Éva Tardos

Publication date 23 October 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46632-0_19

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computing methodologies and applications (68U99)

Recommendations

• Recent developments in approximation algorithms for facility location and clustering problems
• A 2-approximation polynomial algorithm for a clustering problem
• Clustering to minimize the maximum intercluster distance
• scientific article; zbMATH DE number 2081029
• Approximation schemes for clustering problems

Cited in

(11)

• Exact and approximation algorithms for clustering
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
• scientific article; zbMATH DE number 6007853 (Why is no real title available?)
• A constant factor approximation algorithm for a class of classification problems
• Linear-time approximation schemes for clustering problems in any dimensions
• scientific article; zbMATH DE number 1303609 (Why is no real title available?)
• Approximation algorithms for projective clustering
• Approximation algorithms for stochastic clustering
• Approximating a Class of Classification Problems
• Segmentation problems
• Clustering mixtures with almost optimal separation in polynomial time

This page was built for publication: Approximation algorithms for some clustering and classification problems

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