On the complexity of certain problems of choosing subset of vectors
From MaRDI portal
Recommendations
- NP-completeness of some problems of a vectors subset choice
- 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
- The problem of finding a subset of vectors with maximal total weight
- Easy NP-hardness Proofs of Some Subset Choice Problems
Cited in
(14)- Easy NP-hardness Proofs of Some Subset Choice Problems
- On the complexity of some data analysis problems
- scientific article; zbMATH DE number 6004969 (Why is no real title available?)
- NP-completeness of some problems of a vectors subset choice
- Complexity and algorithms for finding a subset of vectors with the longest sum
- Approximation algorithms for some intractable problems of choosing a vector subsequence
- On complexity of the problem of choosing a vector subset with maximal sum length
- On the complexity of some Euclidean optimal summing problems
- Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
- On a variant of the problem of choosing a vector subset
- scientific article; zbMATH DE number 6004955 (Why is no real title available?)
- On the complexity and approximability of some Euclidean optimal summing problems
- Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence
- The problem of finding a subset of vectors with maximal total weight
This page was built for publication: On the complexity of certain problems of choosing subset of vectors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836761)
