activity
20102015
most citedSolving Totally Unimodular LPs with the Shadow Vertex Algorithm

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing 2011Show all

2 papers · 1 filter

cs.DS2011

Improved Smoothed Analysis of Multiobjective Optimization

Tobias Brunsch, Heiko Röglin

We present several new results about smoothed analysis of multiobjective optimization problems. Motivated by the discrepancy between worst-case analysis and practical experience, t…

cs.DS2011

Smoothed Performance Guarantees for Local Search

Tobias Brunsch, Heiko Röglin, Cyriel Rutten +1

We study popular local search and greedy algorithms for scheduling. The performance guarantee of these algorithms is well understood, but the worst-case lower bounds seem somewhat…