Pages that link to "Item:Q685492"
From MaRDI portal
The following pages link to A faster algorithm for the two-center decision problem (Q685492):
Displaying 16 items.
- Improved algorithms for the bichromatic two-center problem for pairs of points (Q824325) (← links)
- New algorithms for \(k\)-center and extensions (Q849133) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- The discrete 2-center problem (Q1272957) (← links)
- A sweepline algorithm to solve the two-center problem (Q1318733) (← links)
- The mixed center location problem (Q1631666) (← links)
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares (Q1737597) (← links)
- The 2-center problem in three dimensions (Q1947989) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- An efficient algorithm for the proximity connected two center problem (Q2169955) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- The Mixed Center Location Problem (Q2958327) (← links)
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES (Q3520427) (← links)
- New Algorithms for k-Center and Extensions (Q5505644) (← links)
- Discrete and mixed two-center problems for line segments (Q6121433) (← links)
- The 2-mixed-center color spanning problem (Q6606233) (← links)