A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
- 10 September 2016
- book chapter
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- On the complexity of some quadratic Euclidean 2-clustering problemsComputational Mathematics and Mathematical Physics, 2016
- NP-hardness of some Quadratic Euclidean 2-clustering problemsDoklady Mathematics, 2015
- Data MiningPublished by Springer Science and Business Media LLC ,2015
- An approximation algorithm for solving a problem of cluster analysisJournal of Applied and Industrial Mathematics, 2011
- NP-hardness of Euclidean sum-of-squares clusteringMachine Learning, 2009
- A posteriori detecting a quasiperiodic fragment in a numerical sequencePattern Recognition and Image Analysis, 2008
- A Randomized Approximation Scheme for Metric MAX-CUTJournal of Computer and System Sciences, 2001
- The Elements of Statistical LearningPublished by Springer Science and Business Media LLC ,2001
- On the Complexity of Clustering ProblemsPublished by Springer Science and Business Media LLC ,1978
- P-Complete Approximation ProblemsJournal of the ACM, 1976