Pages that link to "Item:Q334416"
From MaRDI portal
The following pages link to On the complexity of some Euclidean optimal summing problems (Q334416):
Displaying 6 items.
- On the complexity and approximability of some Euclidean optimal summing problems (Q506239) (← links)
- On the complexity of some Euclidean problems of partitioning a finite set of points (Q521408) (← links)
- Complexity and approximation of the longest vector sum problem (Q1644921) (← links)
- NP-hardness of some Euclidean problems of partitioning a finite set of points (Q1662580) (← links)
- THE COMPLEXITY OF COMPUTING PARTIAL SUMS OFF-LINE (Q3212290) (← links)
- An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture (Q5120487) (← links)