scientific article; zbMATH DE number 6004955
From MaRDI portal
Publication:3115696
Recommendations
- A randomized algorithm for finding a subset of vectors with the maximum Euclidean norm of their sum
- scientific article; zbMATH DE number 6004969
- 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
- On the complexity of certain problems of choosing subset of vectors
- scientific article; zbMATH DE number 10819
- On the optimality conditions for the problem of minimizing a sum of euclidean norms
- On the Vector Sum of Two Convex Sets in Space
- How to obtain maximal and minimal subranges of two-dimensional vector measures
- Finding a subset of nonnegative vectors with a coordinatewise large sum
Cited in
(12)- 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
- Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters
- Polynomial algorithms for solving the vector sum problem
- The problem of finding a subset of vectors with maximal total weight
- Solving some vector subset problems by Voronoi diagrams
- Vectors in a box
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster
- An exact algorithm for finding a vector subset with the longest sum
- Exact pseudo-polynomial algorithms for a balanced 2-clustering problem
- On the complexity and approximability of some Euclidean optimal summing problems
- scientific article; zbMATH DE number 6004969 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3115696)
