On the complexity of some Euclidean optimal summing problems
From MaRDI portal
Recommendations
- On the complexity and approximability of some Euclidean optimal summing problems
- On the complexity of some Euclidean problems of partitioning a finite set of points
- The problem of finding a subset of vectors with maximal total weight
- scientific article; zbMATH DE number 6004969
- NP-hardness of some Euclidean problems of partitioning a finite set of points
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A posteriori detection of a quasiperiodic fragment with a given number of repetitions in a numerical sequence
- On complexity of some problems of cluster analysis of vector sequences
- On the complexity of a search for a subset of ``similar vectors
- On the complexity of certain problems of choosing subset of vectors
- The problem of finding a subset of vectors with maximal total weight
- Trading Hubs Construction for Electricity Markets
Cited in
(7)- NP-hardness of some Euclidean problems of partitioning a finite set of points
- Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
- On the complexity of some Euclidean problems of partitioning a finite set of points
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE
- On the complexity and approximability of some Euclidean optimal summing problems
- Complexity and approximation of the longest vector sum problem
This page was built for publication: On the complexity of some Euclidean optimal summing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334416)
