1 citations · 1 across the 1 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.CC2015★ 1 cited
New Deterministic Algorithms for Solving Parity Games
Matthias Mnich, Heiko Röglin, Clemens Rösner
We study parity games in which one of the two players controls only a small number of nodes and the other player controls the other nodes of the game. Our main result is…
cs.DS2015
Smoothed Analysis of the Successive Shortest Path Algorithm
Tobias Brunsch, Kamiel Cornelissen, Bodo Manthey +2
The minimum-cost flow problem is a classic problem in combinatorial optimization with various applications. Several pseudo-polynomial, polynomial, and strongly polynomial algorithm…