Pages that link to "Item:Q2346580"

The following pages link to Complexity and approximation of the smallest \(k\)-enclosing ball problem (Q2346580):

Displaying 9 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)
• Small \(k\)-pyramids and the complexity of determining \(k\) (Q2253900) (← links)
• On the elimination of inessential points in the smallest enclosing ball problem (Q4622883) (← links)
• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
• The problem of a minimal ball enclosing k points (Q5263806) (← links)
• Algorithms - ESA 2003 (Q5897253) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)