On polynomial solvability of one quadratic Euclidean clustering problem on a line

DOI10.1134/S1064562419040057zbMath1425.68145OpenAlexW4240910132WikidataQ127198866 ScholiaQ127198866MaRDI QIDQ2279767

Alexander Kel'Manov, Vladimir Khandeev

Publication date: 13 December 2019

Published in: Doklady Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064562419040057

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• On the complexity of a search for a subset of ``similar vectors
• NP-hardness of Euclidean sum-of-squares clustering
• Posterior detection of a given number of identical subsequences in a quasi-periodic sequence
• Complexity of certain problems of searching for subsets of vectors and cluster analysis
• A Posteriori Joint Detection and Discrimination of Pulses in a Quasiperiodic Pulse Train
• Cluster Analysis and Mathematical Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On polynomial solvability of one quadratic Euclidean clustering problem on a line