1 citations · 1 across the 4 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
cs.DS2025
A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
Stefan Hougardy, Bart Zondervan
In the Strip Packing problem, we are given a vertical strip of fixed width and unbounded height, along with a set of axis-parallel rectangles. The task is to place all rectangles w…
cs.DS2025
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
Sophia Heimann, Hung P. Hoang, Stefan Hougardy
The -opt algorithm is one of the simplest and most widely used heuristics for solving the traveling salesman problem. Starting from an arbitrary tour, the -opt algorithm impr…