### Abstract

We study algorithms for the minimum mean cycle problem, a parametric version of shortest path feasibility (SPF). The three basic approaches to the problem are cycle-based, binary search, and tree-based. The first two use an SPF algorithm as a subroutine, while the latter uses a parametric approach. When implementing the SPF-based methods, one has a choice of SPF algorithms and incremental optimization strategies. There are also several ways to handle precision issues. This leads to dozens of variants, which we systematically compare. Our experimental setup is more comprehensive than in previous studies. In our experiments, the tree-based method and two implementations of the cycle-based method outperformed other approaches, including binary search.

Original language | English (US) |
---|---|

Title of host publication | 2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009 |

Publisher | Society for Industrial and Applied Mathematics Publications |

Pages | 1-13 |

Number of pages | 13 |

ISBN (Print) | 9780898719307 |

DOIs | |

State | Published - 2009 |

Event | 11th Annual Workshop on Algorithm Engineering and Experiments, ALENEX 2009 - New York, NY, United States Duration: Jan 3 2009 → Jan 3 2009 |

### Publication series

Name | 2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009 |
---|

### Other

Other | 11th Annual Workshop on Algorithm Engineering and Experiments, ALENEX 2009 |
---|---|

Country | United States |

City | New York, NY |

Period | 1/3/09 → 1/3/09 |

### All Science Journal Classification (ASJC) codes

- Modeling and Simulation

## Fingerprint Dive into the research topics of 'An experimental study of minimum mean cycle algorithms'. Together they form a unique fingerprint.

## Cite this

*2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009*(pp. 1-13). (2009 Proceedings of the 11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009). Society for Industrial and Applied Mathematics Publications. https://doi.org/10.1137/1.9781611972894.1