Competitive router scheduling with structured data
暂无分享,去创建一个
[1] Boaz Patt-Shamir,et al. Overflow management with multipart packets , 2012, Comput. Networks.
[2] Boaz Patt-Shamir,et al. Competitive buffer management with packet dependencies , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[3] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..
[4] Jan Kratochvíl,et al. Independent Sets with Domination Constraints , 1998, Discret. Appl. Math..
[5] Boaz Patt-Shamir,et al. Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..
[6] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[7] Boaz Patt-Shamir,et al. Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems , 2013, APPROX-RANDOM.
[8] Boaz Patt-Shamir,et al. Online Set Packing , 2012, SIAM J. Comput..
[9] Jonas Holmerin,et al. Clique Is Hard to Approximate within n1-o(1) , 2000, ICALP.
[10] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[11] Michael H. Goldwasser. A survey of buffer management policies for packet switches , 2010, SIGA.
[12] Boaz Patt-Shamir,et al. Online set packing and competitive scheduling of multi-part tasks , 2010, PODC '10.
[13] Christian E. Hopps,et al. Analysis of an Equal-Cost Multi-Path Algorithm , 2000, RFC.
[14] Boaz Patt-Shamir,et al. Optimal smoothing schedules for real-time streams , 2004, PODC '00.
[15] Piotr Berman,et al. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..
[16] David Thaler,et al. Multipath Issues in Unicast and Multicast Next-Hop Selection , 2000, RFC.
[17] Oded Schwartz,et al. On the Complexity of Approximating k-Dimensional Matching , 2003, RANDOM-APPROX.