The problem of finding a subset of vectors with maximal total weight
From MaRDI portal
(Redirected from Publication:3115657)
Recommendations
- On the complexity of certain problems of choosing subset of vectors
- On a variant of the problem of choosing a vector subset
- On complexity of the problem of choosing a vector subset with maximal sum length
- scientific article; zbMATH DE number 6004955
- Easy NP-hardness Proofs of Some Subset Choice Problems
Cited in
(21)- Complexity and approximation of finding the longest vector sum
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- On the complexity of certain problems of choosing subset of vectors
- Accurate pseudopolynomial-time algorithms for certain NP-hard problems of searching for a vector subsequence
- Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
- Solving some vector subset problems by Voronoi diagrams
- On a variant of the problem of choosing a vector subset
- A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
- On the complexity of some Euclidean optimal summing problems
- Choosing Subsets with Maximum Weighted Average
- Easy NP-hardness Proofs of Some Subset Choice Problems
- Approximability of the problem of finding a vector subset with the longest sum
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- On the complexity and approximability of some Euclidean optimal summing problems
- Approximation algorithms for some intractable problems of choosing a vector subsequence
- An exact algorithm for finding a vector subset with the longest sum
- PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
This page was built for publication: The problem of finding a subset of vectors with maximal total weight
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115657)
