scientific article; zbMATH DE number 7561607
From MaRDI portal
Publication:5091276
DOI10.4230/LIPIcs.ICALP.2019.114MaRDI QIDQ5091276
Dani Dorfman, Haim Kaplan, Uri Zwick
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
The Theory of Universal Graphs for Infinite Duration Games ⋮ Abstract tropical linear programming ⋮ Solving mean-payoff games via quasi dominions ⋮ Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games ⋮ The GKK algorithm is the fastest over simple mean-payoff games
Cites Work
- Unnamed Item
- Polynomial-time algorithms for energy games with special weight structures
- Faster algorithms for mean-payoff games
- Combinatorial structure and randomized subexponential algorithms for infinite games
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- Positional strategies for mean payoff games
- The complexity of mean payoff games on graphs
- Linear programming, the simplex algorithm and simple polytopes
- A subexponential randomized algorithm for the simple stochastic game problem
- A subexponential bound for linear programming
- Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems
- An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm
- Beyond the flow decomposition barrier
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Faster scaling algorithms for general graph matching problems
- Scaling Algorithms for the Shortest Paths Problem
- Deciding parity games in quasipolynomial time
- A modal μ perspective on solving parity games in quasi-polynomial time
This page was built for publication:
