activity
20002026
most citedStrategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor

13 citations · 40 across the 21 of their papers we have counts for

collaborators
Showing 2000 · cs.DSShow all

1 paper · 2 filters

cs.DS2000★ 7 cited

All Pairs Shortest Paths using Bridging Sets and Rectangular Matrix Multiplication

Uri Zwick

We present two new algorithms for solving the {\em All Pairs Shortest Paths} (APSP) problem for weighted directed graphs. Both algorithms use fast matrix multiplication algorithms.…