activity
20142026
most citedDiscovering and Certifying Lower Bounds for the Online Bin Stretching Problem

2 citations · 4 across the 7 of their papers we have counts for

collaborators
Showing 2024Show all

2 papers · 1 filter

cs.DS2024

Improved online load balancing with known makespan

Martin Böhm, Matej Lieskovský, Sören Schmitt +2

We break the barrier of for the problem of online load balancing with known makespan, also known as bin stretching. In this problem, identical machines and the optimal ma…

cs.DS2024

Approximating Traveling Salesman Problems Using a Bridge Lemma

Martin Böhm, Zachary Friggstad, Tobias Mömke +1

We give improved approximations for two metric Traveling Salesman Problem (TSP) variants. In Ordered TSP (OTSP) we are given a linear ordering on a subset of nodes $o_1, \ldots, o_…