Author:
Adjiashvili David,Bosio Sandro,Weismantel Robert,Zenklusen Rico
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V.V., Marchetti-Spaccamela, M., Protasi, M.: Complexity and Approximation. Springer (1999)
2. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J.S., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM, 735–744 (2000)
3. Bar-Noy, A., Guha, S.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31, 331–352 (2002)
4. Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. Nordic J. of Computing 7, 178–184 (2000)
5. Caprara, A.: Packing 2-dimensional bins in harmony. In: Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS 2002, pp. 490–499 (2002)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Non-Preemptive Tree Packing;Algorithmica;2022-08-23
2. Approximation algorithms for the generalized incremental knapsack problem;Mathematical Programming;2022-01-30
3. Flexible Graph Connectivity;Mathematical Programming;2021-05-20
4. Flexible Graph Connectivity;Integer Programming and Combinatorial Optimization;2020