Pages that link to "Item:Q4857592"
From MaRDI portal
The following pages link to A Subexponential Algorithm for Abstract Optimization Problems (Q4857592):
Displayed 9 items.
- Clarkson's algorithm for violator spaces (Q621918) (← links)
- Practical methods for shape fitting and kinetic data structures using coresets (Q1006384) (← links)
- Finding the projection on a polytope: An iterative method (Q1352784) (← links)
- Linear programming, the simplex algorithm and simple polytopes (Q1365056) (← links)
- A subexponential bound for linear programming (Q1923862) (← links)
- Random edge can be exponential on abstract cubes (Q2496719) (← links)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614) (← links)
- THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662) (← links)
- ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS (Q4931731) (← links)