An optimal algorithm for a parallel cutting problem.

zbMATH Open1064.05146MaRDI QIDQ2715973FDOQ2715973

Bill Sands, J. Ginsburg

Publication date: 20 July 2005

Published in: Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

integer partitioncake cuttingminimum number of cutsceleryknife

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorial aspects of partitions of integers (05A17) Extremal combinatorics (05D99)

Cited In (2)

• Chop vectors and the lattice of integer partitions
• An algorithm for the determination of optimal cutting patterns

This page was built for publication: An optimal algorithm for a parallel cutting problem.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2715973)