Pages that link to "Item:Q4824662"
From MaRDI portal
The following pages link to THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS (Q4824662):
Displaying 15 items.
- Miniball (Q17319) (← links)
- The log-exponential smoothing technique and Nesterov's accelerated gradient method for generalized Sylvester problems (Q274096) (← links)
- Unique sink orientations of grids (Q930596) (← links)
- Combinatorial generalizations of Jung's theorem (Q1953063) (← links)
- Algorithms for determining relative position between spheroids and hyperboloids with one sheet (Q1997548) (← links)
- On a minimum enclosing ball of a collection of linear subspaces (Q2032259) (← links)
- A dual simplex-type algorithm for the smallest enclosing ball of balls (Q2044498) (← links)
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem (Q2157894) (← links)
- Random sampling with removal (Q2207595) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- Counting unique-sink orientations (Q2434730) (← links)
- An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING (Q3647614) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
