Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference24 articles.
1. Abolhassani M, Chan HT-H, Chen F, Esfandiari H, Hajiaghayi M, Hamid M, Wu X (2016) Beating ratio 0.5 for weighted oblivious matching problems. In: Sankowski P, Zaroliagis C
2. (ed) 24th annual European symposium on algorithms (ESA 2016), vol 57, pp 3:1-3:18. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
3. Alon N, Azar Y, Woeginger GJ, Yadid Y (1998) Approximation schemes for scheduling on parallel machines. J Sched 1:55–66
4. Blocher JD, Sevastyanov D (2015) A note on the Coffman-Sethi bound for LPT scheduling. J Sched 18:325–327
5. Blum M, Floyd RW, Pratt V, Rivest RL, Tarjan RE (1973) Time bounds for selection. J Comput Syst Sci 7:448–461
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献