Lower Bounds for Howard’s Algorithm for Finding Minimum Mean-Cost Cycles
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 415-426
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it2009
- An Experimental Study of Minimum Mean Cycle Algorithms2009
- Experimental analysis of the fastest optimum cycle ratio and mean algorithmsACM Transactions on Design Automation of Electronic Systems, 2004
- Markov Decision Processes1994
- Finding minimum-cost circulations by canceling negative cyclesJournal of the ACM, 1989
- Applying Parallel Computation Algorithms in the Design of Serial AlgorithmsJournal of the ACM, 1983
- Combinatorial Optimization with Rational Objective FunctionsMathematics of Operations Research, 1979
- A characterization of the minimum cycle mean in a digraphDiscrete Mathematics, 1978
- On a routing problemQuarterly of Applied Mathematics, 1958
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956