Changeset - r816:277ef0218f0c
« 815:aef153
817:b87f05 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Add citations to CycleCanceling (#180, #184)
0 1 0
default
1 file changed with 7 insertions and 3 deletions:
lemon/cycle_canceling.h
7
3
↑ Collapse diff ↑
lemon/cycle_canceling.h
Ignore white space 6 line context
... ... 
@@ -45,7 +45,9 @@
45 45 
  /// finding a \ref min_cost_flow "minimum cost flow".
46 46 
  ///
47 47 
  /// \ref CycleCanceling implements three different cycle-canceling
48 
  /// algorithms for finding a \ref min_cost_flow "minimum cost flow".
48 
  /// algorithms for finding a \ref min_cost_flow "minimum cost flow"
49 
  /// \ref amo93networkflows, \ref klein67primal,
50 
  /// \ref goldberg89cyclecanceling.
49 51 
  /// The most efficent one (both theoretically and practically)
50 52 
  /// is the \ref CANCEL_AND_TIGHTEN "Cancel and Tighten" algorithm,
51 53 
  /// thus it is the default method.
... ... 
@@ -124,12 +126,14 @@
124 126 
      /// number for detecting negative cycles in the residual network.
125 127 
      SIMPLE_CYCLE_CANCELING,
126 128 
      /// The "Minimum Mean Cycle-Canceling" algorithm, which is a
127 
      /// well-known strongly polynomial method. It improves along a
129 
      /// well-known strongly polynomial method
130 
      /// \ref goldberg89cyclecanceling. It improves along a
128 131 
      /// \ref min_mean_cycle "minimum mean cycle" in each iteration.
129 132 
      /// Its running time complexity is O(n<sup>2</sup>m<sup>3</sup>log(n)).
130 133 
      MINIMUM_MEAN_CYCLE_CANCELING,
131 134 
      /// The "Cancel And Tighten" algorithm, which can be viewed as an
132 
      /// improved version of the previous method.
135 
      /// improved version of the previous method
136 
      /// \ref goldberg89cyclecanceling.
133 137 
      /// It is faster both in theory and in practice, its running time
134 138 
      /// complexity is O(n<sup>2</sup>m<sup>2</sup>log(n)).
135 139 
      CANCEL_AND_TIGHTEN
0 comments (0 inline)