Pages that link to "Item:Q2959192"
From MaRDI portal
The following pages link to Solving some vector subset problems by Voronoi diagrams (Q2959192):
Displaying 11 items.
- Complexity and approximation of finding the longest vector sum (Q1785063) (← links)
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Selecting a subset of diverse points based on the squared Euclidean distance (Q2163859) (← links)
- Randomized algorithms for some hard-to-solve problems of clustering a finite set of points in Euclidean space (Q2332640) (← links)
- Approximation scheme for the problem of weighted 2-clustering with a fixed center of one cluster (Q2424187) (← links)
- Easy NP-hardness Proofs of Some Subset Choice Problems (Q4965101) (← links)
- Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- Polynomial-Time Approximation Scheme for a Problem of Searching for the Largest Subset with the Constraint on Quadratic Variation (Q5122318) (← links)
- An exact algorithm for finding a vector subset with the longest sum (Q5374013) (← links)
- Complexity and algorithms for finding a subset of vectors with the longest sum (Q5918111) (← links)
