Pages that link to "Item:Q2346580"
From MaRDI portal
The following pages link to Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580):
Displaying 5 items.
- Approximation and complexity of the capacitated geometric median problem (Q2117109) (← links)
- Linear-size universal discretization of geometric center-based problems in fixed dimensions (Q2125228) (← links)
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648) (← links)
- Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
- Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
