An approximation algorithm for the cutting-sticks problem

DOI10.1016/J.IPL.2014.09.007zbMath1302.68321OpenAlexW2032912512MaRDI QIDQ477614

Jagadish M

Publication date: 9 December 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.09.007

zbMATH Keywords

approximation algorithmscutting-sticks problem

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Approximation algorithms (68W25)

Cites Work

• [https://portal.mardi4nfdi.de/wiki/Publication:4189308 On the Problem of Partitioning {1, 2, � , n} into Subsets having Equal Sums]

This page was built for publication: An approximation algorithm for the cutting-sticks problem