Unformatted text preview: • Maintaining a strongly feasible spanning tree guarantees finite • termination and speeds up the running time • • A pivot iteration is nondegenerate if ± > 0 and is degenerate if ± = 0 • • A degenerate iteration occurs only if T is a degenerate spanning tree. • • If two arcs tie while determining the value of ± , the next spanning tree • will be degenerate....
View
Full
Document
This note was uploaded on 01/26/2011 for the course IEOR 4004 taught by Professor Sethuraman during the Fall '10 term at Columbia.
 Fall '10
 SETHURAMAN

Click to edit the document details