Helly-type theorems and Generalized Linear Programming
- 1 September 1994
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 12 (3) , 241-261
- https://doi.org/10.1007/bf02574379
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- The Componentwise Distance to the Nearest Singular MatrixSIAM Journal on Matrix Analysis and Applications, 1992
- Algorithms for high dimensional stabbing problemsDiscrete Applied Mathematics, 1990
- On the ball spanned by ballsDiscrete & Computational Geometry, 1989
- Systems of linear interval equationsLinear Algebra and its Applications, 1989
- Proof of grünbaum's conjecture on common transversals for translatesDiscrete & Computational Geometry, 1989
- On a Multidimensional Search Technique and Its Application to the Euclidean One-Centre ProblemSIAM Journal on Computing, 1986
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related ProblemsSIAM Journal on Computing, 1983
- BINDING CONSTRAINTS AND HELLY NUMBERSAnnals of the New York Academy of Sciences, 1979
- Helly’s theorem and its relativesPublished by American Mathematical Society (AMS) ,1963
- On Components in Some Families of SetsProceedings of the American Mathematical Society, 1961