What is it about?
The stick-cutting problem is an elementary combinatorial puzzle that arose in a stack exchange question: https://cs.stackexchange.com/questions/30073/cutting-equal-sticks-from-different-sticks In this article, we give a complete solution from the point of view of algorithms.
Featured Image
Perspectives
After we started thinking about this problem, it popped up more or less disguised in other contexts, see my website for details: https://www.wild-inter.net/publications/reitzig-wild-2017
Sebastian Wild
University of Waterloo
Read the Original
This page is a summary of: Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks, Algorithmica, November 2017, Springer Science + Business Media,
DOI: 10.1007/s00453-017-0392-3.
You can read the full text:
Contributors
The following have contributed to this page
