
The paper proposes the Ruler Rolling problem, a more realistic variant of the Ruler Folding and Ruler Wrapping problems, where a carpenter's ruler is folded into a rectangle using 90-degree folds in the same direction. The authors provide a quadratic-time algorithm to find all Pareto-optimal rollings under the assumption that the last segment extends strictly beyond every other.


coremsg

efficient-algorithms-for-folding-carpenter-s-rulers-into-rectangles


Efficient Algorithms for Folding Carpenter's Rulers into Rectangles


title_rewrite


For planar point sets contained in narrow strips, the complexity of the Euclidean Traveling Salesman Problem depends on the strip width. Efficient fixed-parameter tractable algorithms are presented that exploit the geometric structure of the problem.


efficient-algorithms-for-euclidean-traveling-salesman-problem-in-narrow-strips


Efficient Algorithms for Euclidean Traveling Salesman Problem in Narrow Strips
