Pages that link to "Item:Q2412430"
From MaRDI portal
The following pages link to Simple \(O(n \log^{2} n)\) algorithms for the planar 2-center problem (Q2412430):
Displaying 4 items.
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
