On the complexity of polyhedral separability
- 1 December 1988
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 3 (4) , 325-337
- https://doi.org/10.1007/bf02187916
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Computing circular separabilityDiscrete & Computational Geometry, 1986
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- On the complexity of locating linear facilities in the planeOperations Research Letters, 1982