# 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
|
|
| 395 | 395 | @ingroup algs |
| 396 | 396 | \brief Algorithms for finding minimum mean cycles. |
| 397 | 397 | |
| 398 | | This group contains the algorithms for finding minimum mean cycles. |
| | 398 | This group contains the algorithms for finding minimum mean cycles |
| | 399 | \ref clrs01algorithms, \ref amo93networkflows. |
| 399 | 400 | |
| 400 | 401 | The \e minimum \e mean \e cycle \e problem is to find a directed cycle |
| 401 | 402 | of minimum mean length (cost) in a digraph. |
| … |
… |
|
| 411 | 412 | function. |
| 412 | 413 | |
| 413 | 414 | LEMON 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. |
| 415 | 417 | - \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. |
| 418 | 421 | |
| 419 | 422 | In practice, the Howard algorithm proved to be by far the most efficient |
| 420 | 423 | one, though the best known theoretical bound on its running time is |
diff --git a/lemon/hartmann_orlin.h b/lemon/hartmann_orlin.h
|
a
|
b
|
|
| 97 | 97 | /// a minimum mean cycle. |
| 98 | 98 | /// |
| 99 | 99 | /// 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. |
| 101 | 102 | /// It is an improved version of \ref Karp "Karp"'s original algorithm, |
| 102 | 103 | /// it applies an efficient early termination scheme. |
| 103 | 104 | /// It runs in time O(ne) and uses space O(n<sup>2</sup>+e). |
diff --git a/lemon/howard.h b/lemon/howard.h
|
a
|
b
|
|
| 97 | 97 | /// mean cycle. |
| 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 |
| 103 | 104 | /// bound on its running time is exponential. |
diff --git a/lemon/karp.h b/lemon/karp.h
|
a
|
b
|
|
| 97 | 97 | /// mean cycle. |
| 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 | /// |
| 103 | 104 | /// \tparam GR The type of the digraph the algorithm runs on. |
