Online set packing and competitive scheduling of multi-part tasks
暂无分享,去创建一个
Boaz Patt-Shamir | Dror Rawitz | Jaikumar Radhakrishnan | Yishay Mansour | Magnús M. Halldórsson | Yuval Emek
[1] Richard M. Karp,et al. An optimal algorithm for on-line bipartite matching , 1990, STOC '90.
[2] Noga Alon,et al. The online set cover problem , 2003, STOC '03.
[3] Oded Schwartz,et al. On the Complexity of Approximating k-Dimensional Matching , 2003, RANDOM-APPROX.
[4] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[5] Tuomas Sandholm,et al. Algorithm for optimal winner determination in combinatorial auctions , 2002, Artif. Intell..
[6] Baruch Awerbuch,et al. Stateless Distributed Gradient Descent for Positive Linear Programs , 2009, SIAM J. Comput..
[7] Arild Stubhaug. Acta Mathematica , 1886, Nature.
[8] 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..
[9] Johan Håstad,et al. Clique is hard to approximate within n/sup 1-/spl epsiv// , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[10] Noga Alon,et al. Independent Sets in Hypergraphs with Applications to Routing via Fixed Paths , 1999, RANDOM-APPROX.
[11] Lars Engebretsen,et al. Clique Is Hard To Approximate Within , 2000 .
[12] Boaz Patt-Shamir,et al. Competitive buffer management with packet dependencies , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.
[13] Mihalis Yannakakis,et al. Linear programming without the matrix , 1993, STOC.
[14] J. Håstad. Clique is hard to approximate within n 1-C , 1996 .
[15] Piotr Berman,et al. A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..
[16] Joseph Naor,et al. Online Primal-Dual Algorithms for Covering and Packing , 2009, Math. Oper. Res..
[17] Magnús M. Halldórsson,et al. Online independent sets , 2002, Theor. Comput. Sci..
[18] Jan Kratochvíl,et al. Independent Sets with Domination Constraints , 1998, Discret. Appl. Math..
[19] Martin Raab,et al. "Balls into Bins" - A Simple and Tight Analysis , 1998, RANDOM.
[20] Roger Wattenhofer,et al. The price of being near-sighted , 2006, SODA '06.
[21] Michael Luby,et al. A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.