Fair dissections of spiders, worms, and caterpillars
From MaRDI portal
Publication:4712690
DOI10.1002/net.3230200305zbMath0741.05023OpenAlexW2004039823MaRDI QIDQ4712690
Stefano Pallottino, Caterina De Simone, Mario Lucertini, Bruno Simeone
Publication date: 25 June 1992
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230200305
Related Items
A two-dimensional strip cutting problem with sequencing constraint, Weighted Voronoi region algorithms for political districting, Partitioning a weighted tree into subtrees with weights in a given range, Connected graph partitioning with aggregated and non‐aggregated gap objective functions, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Minimum \(L_k\) path partitioning-an illustration of the Monge property, Local search algorithms for political districting, Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches, Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-stage Heuristic Respecting Administrative Boundaries, Most uniform path partitioning and its use in image processing, On a 2-dimensional equipartition problem, Path equipartition in the Chebyshev norm, A shifting algorithm for continuous tree partitioning
Cites Work
