Author:
Chen Lin,Jansen Klaus,Luo Wenchang,Zhang Guochuan
Publisher
Springer International Publishing
Reference20 articles.
1. Alon, N., Azar, Y., Woeginger, G.J., Yadid, T.: Approximation schemes for scheduling on parallel machines. J. Sched. 1, 55–66 (1998)
2. Babel, L., Kellerer, H., Kotov, V.: The $$k$$ -partitioning problem. Math. Methods Oper. Res. 47, 59–82 (1998)
3. Barna, S., Aravind, S.: A new approximation technique for resource-allocation problems. In: Proceedings of the 1st Annual Symposium on Innovations in Computer Science, pp. 342–357 (2010)
4. Bruglieri, M., Ehrgott, M., Hamacher, H.W., Maffioli, F.: An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints. Discret. Appl. Math. 154(9), 1344–1357 (2006)
5. Chen, L., Jansen, K., Zhang, G.C.: On the optimality of approximation schemes for the classical scheduling problem. In: Proceedings of SODA 2014, pp. 657–668 (2014)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献