4 citations · 5 across the 3 of their papers we have counts for
3 papers
Hardness of discrepancy computation and epsilon-net verification in high dimension
Panos Giannopoulos, Christian Knauer, Magnus Wahlström +1
Discrepancy measures how uniformly distributed a point set is with respect to a given set of ranges. There are two notions of discrepancy, namely continuous discrepancy and combina…
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
Benjamin Doerr, Marvin Künnemann, Magnus Wahlström
Following previous theoretical work by Srinivasan (FOCS 2001) and the first author (STACS 2006) and a first experimental evaluation on random instances (ALENEX 2009), we investigat…
Parameterized Two-Player Nash Equilibrium
Danny Hermelin, Chien-Chung Huang, Stefan Kratsch +1
We study the computation of Nash equilibria in a two-player normal form game from the perspective of parameterized complexity. Recent results proved hardness for a number of varian…