Linear Time Algorithms for Two- and Three-Variable Linear Programs
- 1 February 1984
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 13 (1), 31-45
- https://doi.org/10.1137/0213003
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The Complexity of Vertex Enumeration MethodsMathematics of Operations Research, 1983
- Deciding Linear Inequalities by Computing Loop ResiduesJournal of the ACM, 1981
- A Lower Bound to Finding Convex HullsJournal of the ACM, 1981
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- Divide and conquer for linear expected timeInformation Processing Letters, 1978
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Time bounds for selectionJournal of Computer and System Sciences, 1973
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970