Pages that link to "Item:Q1601015"
From MaRDI portal
The following pages link to Exact and approximation algorithms for clustering (Q1601015):
Displaying 14 items.
- (Q5136270) (← links)
- Evaluation of a Branch and Bound Algorithm for Clustering (Q5186698) (← links)
- On capacitated covering with unit balls (Q5266149) (← links)
- ON THE DISCRETE UNIT DISK COVER PROBLEM (Q5300002) (← links)
- (Q5417662) (← links)
- FINDING PLANAR REGIONS IN A TERRAIN – IN PRACTICE AND WITH A GUARANTEE (Q5694056) (← links)
- Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
- Covering convex polygons by two congruent disks (Q5918557) (← links)
- Covering a set of line segments with a few squares (Q5925557) (← links)
- Covering a set of line segments with a few squares (Q5925680) (← links)
- Covering convex polygons by two congruent disks (Q5970791) (← links)
- Clustering mixtures with almost optimal separation in polynomial time (Q6083577) (← links)
- Clustering with faulty centers (Q6092308) (← links)
- Parameterized approximation algorithms and lower bounds for \(k\)-center clustering and variants (Q6586660) (← links)