Deterministic Algorithms for 2-d Convex Programming and 3-d Online Linear Programming
From MaRDI portal
Publication:4209278
DOI10.1006/jagm.1997.0914zbMath0911.90274OpenAlexW2017162295MaRDI QIDQ4209278
Publication date: 24 November 1998
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1997.0914
Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items
Approximating points by a piecewise linear function, Rearranging a sequence of points onto a line, Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications, A simpler linear-time algorithm for intersecting two convex polyhedra in three dimensions, Intersecting disks using two congruent disks, Deterministic Algorithms for Unique Sink Orientations of Grids