Pages that link to "Item:Q4209278"
From MaRDI portal
The following pages link to Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming (Q4209278):
Displaying 6 items.
- A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions (Q728493) (← links)
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications (Q1774529) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Approximating points by a piecewise linear function (Q2375945) (← links)
- Deterministic Algorithms for Unique Sink Orientations of Grids (Q2817878) (← links)
- Intersecting disks using two congruent disks (Q5925580) (← links)