An experimental study of minimum mean cycle algorithms

Loukas Georgiadis, Andrew V. Goldberg, Robert E. Tarjan, Renato F. Werneck

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

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 languageEnglish (US)
Title of host publication11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009
PublisherSociety for Industrial and Applied Mathematics Publications
Pages1-13
Number of pages13
ISBN (Electronic)9781615671489
StatePublished - Jan 1 2009
Event11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009 and 6th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009 - New York, United States
Duration: Jan 3 2009 → …

Publication series

Name11th Workshop on Algorithm Engineering and Experiments and 6th Workshop on Analytic Algorithmics and Combinatorics 2009, ALENEX 2009/ANALCO 2009

Other

Other11th Workshop on Algorithm Engineering and Experiments, ALENEX 2009 and 6th Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2009
CountryUnited States
CityNew York
Period1/3/09 → …

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Materials Chemistry
  • Discrete Mathematics and Combinatorics

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

Cite this