Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference29 articles.
1. Approximating low-congestion routing and column-restricted packing problems;Baveja;Inform. Process. Lett.,2000
2. Approximation algorithms for disjoint paths and related routing and packing problems;Baveja;Math. Oper. Res.,2000
3. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Efficient probabilistically checkable proofs and applications to approximation, in: Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 1993, San Diego, CA, pp. 294–304.
4. Rounding algorithms for covering problems;Bertsimas;Math. Programming,1998
5. R.D. Carr, L.K. Fleischer, V.J. Leung, C.A. Phillips, Strengthening integrality gaps for capacitated network design and covering problems, in: Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000.
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献