Pages that link to "Item:Q2777608"
From MaRDI portal
The following pages link to The 2-center problem with obstacles (Q2777608):
Displaying 16 items.
- Minimal containment under homothetics: a simple cutting plane approach (Q535290) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- An incremental version of the \(k\)-center problem on boundary of a convex polygon (Q887897) (← links)
- An approximation algorithm for \(k\)-center problem on a convex polygon (Q2015790) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Improved approximation bounds for the minimum constraint removal problem (Q2206735) (← links)
- Parametric search: three new applications (Q2266831) (← links)
- Computing a geodesic two-center of points in a simple polygon (Q2331214) (← links)
- A scheme for computing minimum covers within simple regions (Q2428655) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- An algorithmic framework for solving geometric covering problems -- with applications (Q2929639) (← links)
- A Scheme for Computing Minimum Covers within Simple Regions (Q3183475) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
- Constrained k-Center Problem on a Convex Polygon (Q5859739) (← links)
- Intersecting disks using two congruent disks (Q5918623) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)
