A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
We suggest the first strongly subexponential and purely combinatorial algorithm for solving the mean payoff games problem. It is based on iteratively improving the longest shortest distances to a sink in a possibly cyclic directed graph. We identify a new “controlled” version of the shortest paths p...
Saved in:
Published in | Discrete Applied Mathematics Vol. 155; no. 2; pp. 210 - 229 |
---|---|
Main Authors | , |
Format | Journal Article Conference Proceeding |
Language | English |
Published |
Lausanne
Elsevier B.V
2007
Amsterdam Elsevier New York, NY |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!