Competitive Router Scheduling with Structured Data
暂无分享,去创建一个
[1] Jan Kratochvíl,et al. Independent Sets with Domination Constraints , 2000, Discret. Appl. Math..
[2] Boaz Patt-Shamir,et al. Online set packing and competitive scheduling of multi-part tasks , 2010, PODC '10.
[3] Oded Schwartz,et al. On the Complexity of Approximating k-Dimensional Matching , 2003, RANDOM-APPROX.
[4] N. Alon,et al. The Probabilistic Method: Alon/Probabilistic , 2008 .
[5] Boaz Patt-Shamir,et al. Optimal smoothing schedules for real-time streams , 2004, PODC '00.
[6] Piotr Berman,et al. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..
[7] J. Håstad. Clique is hard to approximate withinn1−ε , 1999 .
[8] Boaz Patt-Shamir,et al. Overflow management with multipart packets , 2011, 2011 Proceedings IEEE INFOCOM.
[9] Boaz Patt-Shamir,et al. Optimal smoothing schedules for real-time streams (extended abstract) , 2000, PODC.
[10] Boaz Patt-Shamir,et al. Competitive buffer management with packet dependencies , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[11] Boaz Patt-Shamir,et al. Buffer overflow management in QoS switches , 2001, STOC '01.
[12] 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..
[13] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[14] Michael H. Goldwasser. A survey of buffer management policies for packet switches , 2010, SIGA.