Pages that link to "Item:Q3579227"

The following pages link to Approximate clustering via core-sets (Q3579227):

Displaying 16 items.

• Some Estimates on the Discretization of Geometric Center-Based Problems in High Dimensions (Q4965103) (← links)
• Parameterized Low-Rank Binary Matrix Approximation (Q5002728) (← links)
• Polynomial-Time Approximation Schemes for k-center, k-median, and Capacitated Vehicle Routing in Bounded Highway Dimension (Q5009565) (← links)
• Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction (Q5075781) (← links)
• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling (Q5088979) (← links)
• Approximate minimum enclosing balls in high dimensions using core-sets (Q5463443) (← links)
• New Algorithms for k-Center and Extensions (Q5505644) (← links)
• (Q5743480) (← links)
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries (Q5883715) (← links)
• Analysis of incomplete data and an intrinsic-dimension Helly theorem (Q5901492) (← links)
• Approximating global optimum for probabilistic truth discovery (Q5918182) (← links)
• Polynomial approximate discretization of geometric centers in high-dimensional Euclidean space (Q6161667) (← links)
• Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers (Q6173264) (← links)
• Minimizing the size of the uncertainty regions for centers of moving entities (Q6547939) (← links)
• Approximating fair \(k\)-min-sum-radii in Euclidean space (Q6574937) (← links)
• Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)