The problem of finding a subset of vectors with maximal total weight
From MaRDI portal
Publication:3115657
zbMATH Open1249.90211MaRDI QIDQ3115657FDOQ3115657
Artem Pyatkin, Eh. Kh. Gimadi, Alexei E. Baburin, N. I. Glebov
Publication date: 10 February 2012
Recommendations
Cited In (17)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum
- An exact algorithm for finding a vector subset with the longest sum
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems
- PTAS for \(p\)-means \(q\)-medoids \(r\)-given clustering problem
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum
- Complexity and approximation of finding the longest vector sum
- Fully polynomial-time approximation scheme for a special case of a quadratic Euclidean 2-clustering problem
- Choosing Subsets with Maximum Weighted Average
- A fully polynomial-time approximation scheme for a sequence 2-cluster partitioning problem
- An exact pseudopolynomial algorithm for a problem of the two-cluster partitioning of a set of vectors
- On the complexity of some Euclidean optimal summing problems
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Solving some vector subset problems by Voronoi diagrams
- On the complexity and approximability of some Euclidean optimal summing problems
- Exact pseudopolynomial algorithms for a balanced 2-clustering problem
- Easy NP-hardness Proofs of Some Subset Choice Problems
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)
