A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets

DOI10.1134/S0005117914040018zbMath1297.62141OpenAlexW1992842584MaRDI QIDQ463361

A. E. Galashov, Alexander Kel'Manov

Publication date: 16 October 2014

Published in: Automation and Remote Control (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10)

Related Items (4)

On the complexity of some quadratic Euclidean 2-clustering problems ⋮ An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors ⋮ Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph ⋮ A randomized algorithm for two-cluster partition of a set of vectors

Uses Software

• ElemStatLearn

Cites Work

• Unnamed Item
• NP-hardness of Euclidean sum-of-squares clustering
• Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
• The Planar k-Means Problem is NP-Hard
• An approximation scheme for a problem of search for a vector subset
• Cluster Analysis and Mathematical Programming

This page was built for publication: A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets