Changes in doc/groups.dox [880:38213abd2911:877:141f9c0db4a3] in lemon-1.2
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
doc/groups.dox
r880 r877 264 264 265 265 /** 266 @defgroup matrices Matrices 267 @ingroup datas 268 \brief Two dimensional data storages implemented in LEMON. 269 270 This group contains two dimensional data storages implemented in LEMON. 271 */ 272 273 /** 266 274 @defgroup auxdat Auxiliary Data Structures 267 275 @ingroup datas … … 465 473 466 474 LEMON contains three algorithms for solving the minimum mean cycle problem: 467 - \ref Karp Mmc Karp's original algorithm \ref amo93networkflows,475 - \ref Karp "Karp"'s original algorithm \ref amo93networkflows, 468 476 \ref dasdan98minmeancycle. 469 - \ref HartmannOrlin Mmc Hartmann-Orlin's algorithm, which is an improved477 - \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved 470 478 version of Karp's algorithm \ref dasdan98minmeancycle. 471 - \ref Howard Mmc Howard's policy iteration algorithm479 - \ref Howard "Howard"'s policy iteration algorithm 472 480 \ref dasdan98minmeancycle. 473 481 474 In practice, the \ref HowardMmc "Howard" algorithm proved to be by far the475 most efficient one, though the best known theoretical bound on its running 476 time isexponential.477 Both \ref KarpMmc "Karp" and \ref HartmannOrlinMmc "Hartmann-Orlin" algorithms478 run in time O(ne) and use space O(n<sup>2</sup>+e), but the latter one is 479 typically faster due to theapplied early termination scheme.482 In practice, the Howard algorithm proved to be by far the most efficient 483 one, though the best known theoretical bound on its running time is 484 exponential. 485 Both Karp and HartmannOrlin algorithms run in time O(ne) and use space 486 O(n<sup>2</sup>+e), but the latter one is typically faster due to the 487 applied early termination scheme. 480 488 */ 481 489
Note: See TracChangeset
for help on using the changeset viewer.