Approximating low-congestion routing and column-restricted packing problems
暂无分享,去创建一个
[1] Clifford Stein,et al. Approximating Disjoint-Path Problems Using Greedy Algorithms and Packing Integer Programs ( Extended Abstract ) , 1998 .
[2] W. Hoeffding. Probability Inequalities for sums of Bounded Random Variables , 1963 .
[3] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[4] Aravind Srinivasan,et al. Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems , 2000, Math. Oper. Res..
[5] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .