Author:
Chakrabarty Deeparnab,Grant Elyot,Könemann Jochen
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Balas, E.: Facets of the knapsack polytope. Math. Programming 8, 146–164 (1975)
2. Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48(5), 1069–1090 (2001)
3. Carr, R.D., Fleischer, L.K., Leung, V.J., Phillips, C.A.: Strengthening integrality gaps for capacitated network design and covering problems. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms, pp. 106–115 (2000)
4. Chakrabarty, D., Grant, E., Könemann, J.: On column-restricted and priority covering integer programs. arXiv eprint (2010)
5. Charikar, M., Naor, J., Schieber, B.: Resource optimization in qos multicast routing of real-time multimedia. IEEE/ACM Trans. Netw. 12(2), 340–348 (2004)
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献