2 citations · 4 across the 2 of their papers we have counts for
5 papers · 1 filter
Hard Instances on Demand
Jamie Fravel, Martin Koutecký, Pavlo Tsitsei
The conclusions of an experimental study of algorithms are only as good as the instances they are run on. Benchmark libraries for well-studied problems took decades to curate, whil…
Improved Analysis of Online Balanced Clustering
Marcin Bienkowski, Martin Böhm, Martin Koutecký +3
In the online balanced graph repartitioning problem, one has to maintain a clustering of nodes into clusters, each having nodes. During runtime, an online…
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines
Martin Koutecký, Johannes Zink
The task of scheduling jobs to machines while minimizing the total makespan, the sum of weighted completion times, or a norm of the load vector, are among the oldest and most funda…
Scheduling Kernels via Configuration LP
Dušan Knop, Martin Koutecký
Makespan minimization (on parallel identical or unrelated machines) is arguably the most natural and studied scheduling problem. A common approach in practical algorithm design is…
Parameterized Algorithms for MILPs with Small Treedepth
Cornelius Brand, Martin Koutecký, Sebastian Ordyniak
Solving (mixed) integer linear programs, (M)ILPs for short, is a fundamental optimization task. While hard in general, recent years have brought about vast progress for solving str…