Pages that link to "Item:Q4024308"
From MaRDI portal
The following pages link to Dynamic Three-Dimensional Linear Programming (Q4024308):
Displayed 9 items.
- Geometric matching algorithms for two realistic terrains (Q683754) (← links)
- A fast algorithm for the alpha-connected two-center decision problem (Q1007526) (← links)
- A criterion for the affine equivalence of cell complexes in \(R^ d\) and convex polyhedra in \(R^{d+1}\) (Q1085799) (← links)
- Dynamic Euclidean minimum spanning trees and extrema of binary functions (Q1346130) (← links)
- Optimal separable partitioning in the plane (Q1893156) (← links)
- On the planar two-center problem and circular hulls (Q2105328) (← links)
- Efficient planar two-center algorithms (Q2230394) (← links)
- BOUNDED-VELOCITY APPROXIMATION OF MOBILE EUCLIDEAN 2-CENTRES (Q3520427) (← links)
- Efficient \(k\)-center algorithms for planar points in convex position (Q6179418) (← links)