Separable partitions
- 26 January 1999
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 91 (1-3), 39-51
- https://doi.org/10.1016/s0166-218x(98)00142-5
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A Polynomial Time Algorithm for Shaped Partition ProblemsSIAM Journal on Optimization, 1999
- Geometric clusteringsJournal of Algorithms, 1991
- Covering convex sets with non-overlapping polygonsDiscrete Mathematics, 1990
- On the density of families of setsJournal of Combinatorial Theory, Series A, 1972
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971
- Some properties of Davenport-Schinzel sequencesActa Arithmetica, 1970
- A Combinatorial Problem Connected with Differential EquationsAmerican Journal of Mathematics, 1965
- A Sequence of Polyhedra Having Intersections of Specified DimensionsJournal of the London Mathematical Society, 1947