Changeset 771:8452ca46e29a in lemon1.2
 Timestamp:
 10/15/09 12:55:41 (15 years ago)
 Branch:
 default
 Phase:
 public
 Files:

 4 edited
Legend:
 Unmodified
 Added
 Removed

doc/groups.dox
r770 r771 458 458 \brief Algorithms for finding minimum mean cycles. 459 459 460 This group contains the algorithms for finding minimum mean cycles. 460 This group contains the algorithms for finding minimum mean cycles 461 \ref clrs01algorithms, \ref amo93networkflows. 461 462 462 463 The \e minimum \e mean \e cycle \e problem is to find a directed cycle … … 474 475 475 476 LEMON contains three algorithms for solving the minimum mean cycle problem: 476  \ref Karp "Karp"'s original algorithm. 477  \ref Karp "Karp"'s original algorithm \ref amo93networkflows, 478 \ref dasdan98minmeancycle. 477 479  \ref HartmannOrlin "HartmannOrlin"'s algorithm, which is an improved 478 version of Karp's algorithm. 479  \ref Howard "Howard"'s policy iteration algorithm. 480 version of Karp's algorithm \ref dasdan98minmeancycle. 481  \ref Howard "Howard"'s policy iteration algorithm 482 \ref dasdan98minmeancycle. 480 483 481 484 In practice, the Howard algorithm proved to be by far the most efficient 
lemon/hartmann_orlin.h
r769 r771 98 98 /// 99 99 /// This class implements the HartmannOrlin 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. 101 102 /// It is an improved version of \ref Karp "Karp"'s original algorithm, 102 103 /// it applies an efficient early termination scheme. 
lemon/howard.h
r769 r771 98 98 /// 99 99 /// 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. 101 102 /// This class provides the most efficient algorithm for the 102 103 /// minimum mean cycle problem, though the best known theoretical 
lemon/karp.h
r769 r771 98 98 /// 99 99 /// 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. 101 102 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). 102 103 ///
Note: See TracChangeset
for help on using the changeset viewer.