Pages that link to "Item:Q3445959"
From MaRDI portal
The following pages link to Approximation algorithms for spreading points (Q3445959):
Displaying 17 items.
- Constrained \(k\)-center and movement to independence (Q534356) (← links)
- Controlled perturbation of sets of line segments in \(\mathbb R^2\) with smart processing order (Q543787) (← links)
- Dispersion in disks (Q693055) (← links)
- Approximation algorithms for aligning points (Q1879366) (← links)
- Minimum color spanning circle of imprecise points (Q2166769) (← links)
- Largest bounding box, smallest diameter, and related problems on imprecise points (Q2269143) (← links)
- Systems of distant representatives in Euclidean space (Q2347967) (← links)
- Convex hulls under uncertainty (Q2408916) (← links)
- Nearest-neighbor searching under uncertainty. I (Q2411831) (← links)
- Minimum color spanning circle in imprecise setup (Q2695293) (← links)
- Dispersion in unit disks (Q3113758) (← links)
- Efficient Approximations for the Online Dispersion Problem (Q4634023) (← links)
- On approximating point spread distributions (Q4914976) (← links)
- Approximation and Online Algorithms (Q5713451) (← links)
- Away from each other (Q6091146) (← links)
- The dispersive art gallery problem (Q6092310) (← links)
- Spreading points using gradient and tabu (Q6097431) (← links)