Author:
Chen Lin,Ye Deshi,Zhang Guochuan
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference8 articles.
1. A. Bhaskara, R. Krishnaswamy, K. Talwar, U. Wieder, Minimum makespan scheduling with low rank processing times, in: Proceedings of the 24th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2013, pp. 937–947.
2. L. Chen, K. Jansen, G. Zhang, On the optimality of approximation schemes for the classical scheduling problem, in: Proceedings of the 25th Annual ACM–SIAM Symposium on Discrete Algorithms, SODA, 2014, pp. 657–668.
3. L. Chen, D. Ye, G. Zhang, A note on scheduling with low rank processing times, 2013. CoRR abs/1306.3727.
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach;Hochbaum;SIAM J. Comput.,1988
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献