Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- 1 November 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 12 (4), 759-776
- https://doi.org/10.1137/0212052
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A Hidden-Line Algorithm for HyperspaceSIAM Journal on Computing, 1982
- Single Facility $l_p $-Distance Minimax LocationSIAM Journal on Algebraic Discrete Methods, 1980
- The complexity of linear programmingTheoretical Computer Science, 1980
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- On p-Centers in NetworksTransportation Science, 1978
- Expected time bounds for selectionCommunications of the ACM, 1975
- A Minimax Location Problem on a NetworkTransportation Science, 1974
- Geometrical Solutions for Some Minimax Location ProblemsTransportation Science, 1972
- An efficient algorith for determining the convex hull of a finite planar setInformation Processing Letters, 1972
- Letter to the Editor—Some Aspects of a Minimax Location ProblemOperations Research, 1967