Fast algorithms for energy games in special cases
From MaRDI portal
Cites work
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
- A faster deterministic exponential time algorithm for energy games and mean payoff games
- Algorithms – ESA 2005
- Bellman-Ford is optimal for shortest Hop-bounded paths
- Better Quality in Synthesis through Quantitative Objectives
- Borel determinacy
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Deciding Parity Games in Quasi-polynomial Time
- Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\)
- Depth-First Search and Linear Graph Algorithms
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Faster algorithms for mean-payoff games
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
- Infinite Runs in Weighted Timed Automata with Energy Constraints
- Looking at mean-payoff and total-payoff through windows
- Negative-weight single-source shortest paths in near-linear time
- On the exponent of all pairs shortest path problem
- Optimal energetic paths for electric cars
- Polynomial-time algorithms for energy games with special weight structures
- Positional strategies for mean payoff games
- Reachability games with relaxed energy constraints
- Subcubic equivalences between path, matrix, and triangle problems
- The complexity of mean payoff games on graphs
- Using strategy improvement to stay alive
- Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
This page was built for publication: Fast algorithms for energy games in special cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940526)
