Publisher
Springer International Publishing
Reference19 articles.
1. Asahiro, Y., Jansson, J., Miyano, E., Ono, H., Zenmyo, K.: Approximation algorithms for the graph orientation minimizing the maximum weighted outdegree. J. Comb. Optim. 22(1), 78–96 (2011)
2. Bodlaender, H., Jansen, K., Woeginger, G.: Scheduling with incompatible jobs. Discret. Appl. Math. 55(3), 219–232 (1994)
3. Chakrabarty, D., Khanna, S., Li, S.: On (1, $$\varepsilon $$)-restricted assignment makespan minimization. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1087–1101 (2015)
4. Das, S., Wiese, A.: On minimizing the makespan when some jobs cannot be assigned on the same machine. In: 24th Annual European Symposium on Algorithms, LIPIcs, vol. 87, pp. 31:1–31:14 (2017)
5. Dokka, T., Kouvela, A., Spieksma, F.: Approximating the multi-level bottleneck assignment problem. Oper. Res. Lett. 40, 282–286 (2012)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献