Recommendations
- Two-Dimensional partitioning problems
- On two partition problems
- On a Problem of Partitions
- The partition problem for equifacetal simplices
- Two-dimensional partitions
- 2K2-Partition Problem
- scientific article; zbMATH DE number 4101263
- On the two-dimensional Davenport-Schinzel problem
- On the equipartition of plane convex bodies and convex polygons
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3612276 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Linear Tree Partitioning Algorithm
- A Shifting Algorithm for Min-Max Tree Partitioning
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- Efficient algorithms for interval graphs and circular-arc graphs
- Efficient implementation of a shifting algorithm
- Fair dissections of spiders, worms, and caterpillars
- Max-Min Tree Partitioning
- Max-min partitioning of grid graphs into connected components
- Most uniform path partitioning and its use in image processing
- Partitioning a matrix to minimize the maximum cost
- Shifting algorithms for tree partitioning with general weighting functions
- Tabu Search—Part I
- Tabu Search—Part II
- The dissection of rectangles into squares
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands
Cited in
(5)- The equipartition polytope. I: Formulations, dimension and basic facets
- Partitioning a matrix with non-guillotine cuts to minimize the maximum cost
- A polynomial-time algorithm for max-min partitioning of ladders
- Max-min partitioning of grid graphs into connected components
- Path equipartition in the Chebyshev norm
This page was built for publication: On a 2-dimensional equipartition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806658)
