An approximation algorithm for solving the problem of the search of a subset of vectors
From MaRDI portal
Publication:3115249
zbMATH Open1249.90189MaRDI QIDQ3115249FDOQ3115249
Authors: S. M. Romanchenko, A. V. Kel'manov 
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
Cited In (10)
- Search problems in vector spaces
- Approximation algorithms for some intractable problems of choosing a vector subsequence
- An approximation algorithm for a problem of cluster analysis
- An FPTAS for a vector subset search problem
- An approximation scheme for a problem of search for a vector subset
- A 2-approximate algorithm to solve one problem of the family of disjoint vector subsets
- On the complexity of a search for a subset of ``similar vectors
- Efficient randomized algorithm for a vector subset problem
- On a variant of the problem of choosing a vector subset
- 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)
