On the complexity of some geometric problems in unbounded dimension
- 1 January 1990
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 10 (3-4) , 327-334
- https://doi.org/10.1016/s0747-7171(08)80067-3
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- On the complexity of polyhedral separabilityDiscrete & Computational Geometry, 1988
- Approximation schemes for covering and packing problems in image processing and VLSIJournal of the ACM, 1985
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- The weighted euclidean 1-center problemOperations Research Letters, 1982
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981