An approximation algorithm for solving the problem of the search of a subset of vectors

zbMATH Open1249.90189MaRDI QIDQ3115249FDOQ3115249

A. V. Kel'manov, S. M. Romanchenko

Publication date: 20 February 2012

Recommendations

• An approximation algorithm for a problem of cluster analysis
• A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
• A 2-approximation polynomial algorithm for a clustering problem
• NP-completeness of some problems of a vectors subset choice
• Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems

zbMATH Keywords

NP-hardnesseffective approximation algorithmsearching for subset of vectors

Mathematics Subject Classification ID

Quadratic programming (90C20)

Cited In (3)

• Search problems in vector spaces
• An FPTAS for a vector subset search problem
• Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems

This page was built for publication: An approximation algorithm for solving the problem of the search of a subset of vectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115249)