Changeset - r771:8452ca46e29a
« 770:432c54
772:f964a0 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Add citations to the min mean cycle classes (#179, #184)
0 4 0
default
4 files changed with 13 insertions and 7 deletions:
doc/groups.dox
7
4
lemon/hartmann_orlin.h
2
1
lemon/howard.h
2
1
lemon/karp.h
2
1
↑ Collapse diff ↑
doc/groups.dox
Ignore white space 6 line context
... ... 
@@ -459,3 +459,4 @@
459 459 

			




	460
	
	
		
This group contains the algorithms for finding minimum mean cycles.


			




	
	460
	
		
This group contains the algorithms for finding minimum mean cycles


			




	
	461
	
		
\ref clrs01algorithms, \ref amo93networkflows.


			




	461
	462
	
		

			




	...
	...
	
		
@@ -475,6 +476,8 @@


			




	475
	476
	
		
LEMON contains three algorithms for solving the minimum mean cycle problem:


			




	476
	
	
		
- \ref Karp "Karp"'s original algorithm.


			




	
	477
	
		
- \ref Karp "Karp"'s original algorithm \ref amo93networkflows,


			




	
	478
	
		
  \ref dasdan98minmeancycle.


			




	477
	479
	
		
- \ref HartmannOrlin "Hartmann-Orlin"'s algorithm, which is an improved


			




	478
	
	
		
  version of Karp's algorithm.


			




	479
	
	
		
- \ref Howard "Howard"'s policy iteration algorithm.


			




	
	480
	
		
  version of Karp's algorithm \ref dasdan98minmeancycle.


			




	
	481
	
		
- \ref Howard "Howard"'s policy iteration algorithm


			




	
	482
	
		
  \ref dasdan98minmeancycle.


			




	480
	483
	
		

			




        

    

    

    

        

            

                

                    lemon/hartmann_orlin.h
                

                

                  
                  
                  
                  Show white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -99,3 +99,4 @@


			




	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,

			




        

    

    

    

        

            

                

                    lemon/howard.h
                

                

                  
                  
                  
                  Ignore white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -99,3 +99,4 @@


			




	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

			




        

    

    

    

        

            

                

                    lemon/karp.h
                

                

                  
                  
                  
                  Ignore white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -99,3 +99,4 @@


			




	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).


			




        

    






    
    



    


    

     
    
0 comments (0 inline)