1.99, (3) the idealistic second-order method with 6 = 1.97, and (4) the Maximum Concurrent Flow code of Leong, Shor, and Stein [LSS93], referred to as LSS. Algorithm 25 commodities 50 commodities 100 commodities Leong-Shor-Steinanbsp;...
|Title||:||Randomization and Approximation Techniques in Computer Science|
|Author||:||Michael Luby, Jose Rolim, Maria Serna|
|Publisher||:||Springer - 2003-05-20|