2 citations · 4 across the 2 of their papers we have counts for
6 papers
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…
A Note on the Approximability of Deepest-Descent Circuit Steps
Steffen Borgwardt, Cornelius Brand, Andreas Emil Feldmann +1
Linear programs (LPs) can be solved by polynomially many moves along the circuit direction improving the objective the most, so-called deepest-descent steps (dd-steps). Computing t…
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…
Multi-Party Campaigning
Martin Koutecký, Nimrod Talmon
We study a social choice setting of manipulation in elections and extend the usual model in two major ways: first, instead of considering a single manipulating agent, in our settin…
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…