Changeset 1164:f63ba40a60f4 in lemon for lemon
 Timestamp:
 01/30/12 23:24:14 (10 years ago)
 Branch:
 default
 Phase:
 public
 Location:
 lemon
 Files:

 3 edited
Legend:
 Unmodified
 Added
 Removed

lemon/hartmann_orlin_mmc.h
r959 r1164 99 99 /// This class implements the HartmannOrlin algorithm for finding 100 100 /// a directed cycle of minimum mean cost in a digraph 101 /// \ref amo93networkflows, \ref dasdan98minmeancycle.101 /// \ref hartmann93finding, \ref dasdan98minmeancycle. 102 102 /// It is an improved version of \ref KarpMmc "Karp"'s original algorithm, 103 103 /// it applies an efficient early termination scheme. 
lemon/howard_mmc.h
r956 r1164 99 99 /// This class implements Howard's policy iteration algorithm for finding 100 100 /// a directed cycle of minimum mean cost in a digraph 101 /// \ref amo93networkflows, \ref dasdan98minmeancycle.101 /// \ref dasdan98minmeancycle, \ref dasdan04experimental. 102 102 /// This class provides the most efficient algorithm for the 103 103 /// minimum mean cycle problem, though the best known theoretical 
lemon/karp_mmc.h
r956 r1164 99 99 /// This class implements Karp's algorithm for finding a directed 100 100 /// cycle of minimum mean cost in a digraph 101 /// \ref amo93networkflows, \ref dasdan98minmeancycle.101 /// \ref karp78characterization, \ref dasdan98minmeancycle. 102 102 /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). 103 103 ///
Note: See TracChangeset
for help on using the changeset viewer.