NP-completeness of some problems of a vectors subset choice
From MaRDI portal
Publication:3115233
zbMATH Open1249.68080MaRDI QIDQ3115233FDOQ3115233
Authors: A. V. Kel'manov, Artem Pyatkin 
Publication date: 20 February 2012
Recommendations
- On the complexity of certain problems of choosing subset of vectors
- On complexity of the problem of choosing a vector subset with maximal sum length
- On a variant of the problem of choosing a vector subset
- On the complexity of some data analysis problems
- Easy NP-hardness Proofs of Some Subset Choice Problems
Cited In (15)
- An approximation algorithm for solving the problem of the search of a subset of vectors
- On the complexity of some data analysis problems
- On the complexity of certain problems of choosing subset of vectors
- Title not available (Why is that?)
- An FPTAS for a vector subset search problem
- Column subset selection is NP-complete
- On complexity of the problem of choosing a vector subset with maximal sum length
- Vandermonde matrices, NP-completeness and transversal subspaces
- Complexity of the weighted max-cut in Euclidean space
- On a variant of the problem of choosing a vector subset
- Solving some vector subset problems by Voronoi diagrams
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space
- Pseudopolynomial algorithms for certain computationally hard vector subset and cluster analysis problems
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
- Easy NP-hardness Proofs of Some Subset Choice Problems
This page was built for publication: NP-completeness of some problems of a vectors subset choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115233)
