Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem
- 14 September 2020
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering ProblemPublished by Springer Science and Business Media LLC ,2016
- Exact pseudopolynomial algorithms for a balanced 2-clustering problemJournal of Applied and Industrial Mathematics, 2016
- On the complexity of some quadratic Euclidean 2-clustering problemsComputational Mathematics and Mathematical Physics, 2016
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problemComputational 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 Introduction to Statistical LearningPublished by Springer Science and Business Media LLC ,2013
- An approximation algorithm for solving a problem of search for a vector subsetJournal of Applied and Industrial Mathematics, 2012
- The Elements of Statistical LearningPublished by Springer Science and Business Media LLC ,2009
- Cluster Analysis and Mathematical ProgrammingJournal of the American Statistical Association, 1971