Randomization Methods in Algorithm Design

Randomization Methods in Algorithm Design

4.11 - 1251 ratings - Source

[KR] J. Kleinberg and R. Rubinfeld. Short paths in ... 86-95. [KT] J. Kleinberg and E. Tardos, Disjoint paths in densely embedded networks, in Proc. ... Computing near- optimal solutions to combinatorial NETWORK DESIGN AND ROUTING 301 .

Title:Randomization Methods in Algorithm Design
Author:Panos M. Pardalos, Sanguthevar Rajasekaran, José D. P. Rolim
Publisher:American Mathematical Soc. -


You Must CONTINUE and create a free account to access unlimited downloads & streaming