58 citations · 151 across the 35 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
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…
cs.CC2010★ 1 cited
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…