Finding tailored partitions
- 30 September 1991
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 12 (3) , 431-463
- https://doi.org/10.1016/0196-6774(91)90013-o
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On the rectangularp-center problemNaval Research Logistics (NRL), 1987
- Diameter partitioningDiscrete & Computational Geometry, 1986
- On the convex layers of a planar setIEEE Transactions on Information Theory, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- On the Complexity of Some Common Geometric Location ProblemsSIAM Journal on Computing, 1984
- On the shape of a set of points in the planeIEEE Transactions on Information Theory, 1983
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Maintenance of configurations in the planeJournal of Computer and System Sciences, 1981
- An optimal real-time algorithm for planar convex hullsCommunications of the ACM, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977