Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem
From MaRDI portal
Publication:4965097
DOI10.1007/978-3-030-58657-7_4zbMath1460.90152OpenAlexW3085561310MaRDI QIDQ4965097
Anna Panasenko, Vladimir Khandeev
Publication date: 25 February 2021
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_4
Euclidean spaceexact algorithmNP-hard problempolynomial-timeone-dimensional caseweighted clusteringminimum sum-of-squares
Uses Software
Cites Work
- Unnamed Item
- NP-hardness of some quadratic Euclidean 2-clustering problems
- PRMLT
- Polynomial-time approximation algorithm for the problem of cardinality-weighted variance-based 2-clustering with a given center
- A PTAS for one Cardinality-Weighted 2-Clustering problem
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- On the complexity of some quadratic Euclidean 2-clustering problems
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem
- A Fully Polynomial-Time Approximation Scheme for a Special Case of a Balanced 2-Clustering Problem
- An Introduction to Statistical Learning
- Data Mining
- Cluster Analysis and Mathematical Programming
This page was built for publication: Exact Algorithm for the One-Dimensional Quadratic Euclidean Cardinality-Weighted 2-Clustering with Given Center Problem
