AUTHORS
author Peter Kovacs <kpeter@inf.elte.hu>
Thu, 15 Nov 2012 07:17:48 +0100
changeset 1179 f6f6896a4724
parent 1072 3dcb45a871c3
permissions -rw-r--r--
Ensure strongly polynomial running time for CycleCanceling (#436)
The number of iterations performed by Howard's algorithm is limited.
If the limit is reached, a strongly polynomial implementation,
HartmannOrlinMmc is executed to find a minimum mean cycle.
This iteration limit is typically not reached, thus the combined
method is practically equivalent to Howard's algorithm, while it
also ensures the strongly polynomial time bound.
     1 The main developers of release series 1.x are
     2 
     3  * Balazs Dezso <deba@inf.elte.hu>
     4  * Alpar Juttner <alpar@cs.elte.hu>
     5  * Peter Kovacs <kpeter@inf.elte.hu>
     6  * Akos Ladanyi <ladanyi@tmit.bme.hu>
     7 
     8 For more complete list of contributors, please visit the history of
     9 the LEMON source code repository: http://lemon.cs.elte.hu/hg/lemon
    10 
    11 Moreover, this version is heavily based on version 0.x of LEMON. Here
    12 is the list of people who contributed to those versions.
    13 
    14  * Mihaly Barasz <klao@cs.elte.hu>
    15  * Johanna Becker <beckerjc@cs.elte.hu>
    16  * Attila Bernath <athos@cs.elte.hu>
    17  * Balazs Dezso <deba@inf.elte.hu>
    18  * Peter Hegyi <hegyi@tmit.bme.hu>
    19  * Alpar Juttner <alpar@cs.elte.hu>
    20  * Peter Kovacs <kpeter@inf.elte.hu>
    21  * Akos Ladanyi <ladanyi@tmit.bme.hu>
    22  * Marton Makai <marci@cs.elte.hu>
    23  * Jacint Szabo <jacint@cs.elte.hu>
    24 
    25 Again, please visit the history of the old LEMON repository for more
    26 details: http://lemon.cs.elte.hu/hg/lemon-0.x