Pages that link to "Item:Q3201788"
From MaRDI portal
The following pages link to Finding k points with minimum diameter and related problems (Q3201788):
Displayed 16 items.
- On enclosing k points by a circle (Q674185) (← links)
- An O\((\log k)\)-approximation algorithm for the \(k\) minimum spanning tree problem in the plane (Q679454) (← links)
- Region-restricted clustering for geographic data mining (Q1000925) (← links)
- Finding minimum area \(k\)-gons (Q1186081) (← links)
- Finding the \(k\) smallest spanning trees (Q1196455) (← links)
- Iterated nearest neighbors and finding minimal polytopes (Q1327455) (← links)
- Computing the smallest \(k\)-enclosing circle and related problems (Q1328752) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Compact location problems (Q1391322) (← links)
- On geometric optimization with few violated constraints (Q1906043) (← links)
- On finding a large number of 3D points with a small diameter (Q2457016) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- QUANTILE APPROXIMATION FOR ROBUST STATISTICAL ESTIMATION AND k-ENCLOSING PROBLEMS (Q2708040) (← links)
- Minimum area polygons with two reflex angles enclosing<i>k</i>Points (Q2752250) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Computing the Smallest T-Shaped Polygon Containing k Points (Q4780527) (← links)