15 citations · 35 across the 19 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2012★ 2 cited
Smoothed Complexity Theory
Markus Bläser, Bodo Manthey
Smoothed analysis is a new way of analyzing algorithms introduced by Spielman and Teng (J. ACM, 2004). Classical methods like worst-case or average-case analysis have accompanying…
cs.CC2005★ 10 cited
On Approximating Restricted Cycle Covers
Bodo Manthey
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set…