COIN-OR::LEMON - Graph Library

About

Downloads

Documentation

Development

Issue Tracker

Browse Tickets

Custom Query

Roadmap

Browse Source

Local Info

Mailing Lists

Search

Ticket #179: 179-184-mmc-bib-4ac26e328df3.patch

File 179-184-mmc-bib-4ac26e328df3.patch, 3.1 KB (added by Peter Kovacs, 15 years ago)

  • doc/groups.dox 

    # HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1255604141 -7200
# Node ID 4ac26e328df34c536ae56732ca90aa80bee09d1d
# Parent  5d1795170bb6df49b84e652c71faf8de581be862
Add citations to the min mean cycle classes (#179, #184)

diff --git a/doc/groups.dox b/doc/groups.dox
    a b  
    395395@ingroup algs
    396396\brief Algorithms for finding minimum mean cycles.
    397397
    398 This group contains the algorithms for finding minimum mean cycles.
     398This group contains the algorithms for finding minimum mean cycles
     399\ref clrs01algorithms, \ref amo93networkflows.
    399400
    400401The \e minimum \e mean \e cycle \e problem is to find a directed cycle
    401402of minimum mean length (cost) in a digraph.
    … …  
    411412function.
    412413
    413414LEMON contains three algorithms for solving the minimum mean cycle problem:
    414 - \ref Karp "Karp"'s original algorithm.
     415- \ref Karp "Karp"'s original algorithm \ref amo93networkflows,
     416  \ref dasdan98minmeancycle.
    415417- \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved
    416   version of Karp's algorithm.
    417 - \ref Howard "Howard"'s policy iteration algorithm.
     418  version of Karp's algorithm \ref dasdan98minmeancycle.
     419- \ref Howard "Howard"'s policy iteration algorithm
     420  \ref dasdan98minmeancycle.
    418421
    419422In practice, the Howard algorithm proved to be by far the most efficient
    420423one, though the best known theoretical bound on its running time is

  • lemon/hartmann_orlin.h 

    diff --git a/lemon/hartmann_orlin.h b/lemon/hartmann_orlin.h
    a b  
    9797  /// a minimum mean cycle.
    9898  ///
    9999  /// This class implements the Hartmann-Orlin algorithm for finding
    100   /// a directed cycle of minimum mean length (cost) in a digraph.
     100  /// a directed cycle of minimum mean length (cost) in a digraph
     101  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    101102  /// It is an improved version of \ref Karp "Karp"'s original algorithm,
    102103  /// it applies an efficient early termination scheme.
    103104  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).

  • lemon/howard.h 

    diff --git a/lemon/howard.h b/lemon/howard.h
    a b  
    9797  /// mean cycle.
    9898  ///
    9999  /// This class implements Howard's policy iteration algorithm for finding
    100   /// a directed cycle of minimum mean length (cost) in a digraph.
     100  /// a directed cycle of minimum mean length (cost) in a digraph
     101  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    101102  /// This class provides the most efficient algorithm for the
    102103  /// minimum mean cycle problem, though the best known theoretical
    103104  /// bound on its running time is exponential.

  • lemon/karp.h 

    diff --git a/lemon/karp.h b/lemon/karp.h
    a b  
    9797  /// mean cycle.
    9898  ///
    9999  /// This class implements Karp's algorithm for finding a directed
    100   /// cycle of minimum mean length (cost) in a digraph.
     100  /// cycle of minimum mean length (cost) in a digraph
     101  /// \ref amo93networkflows, \ref dasdan98minmeancycle.
    101102  /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e).
    102103  ///
    103104  /// \tparam GR The type of the digraph the algorithm runs on.