Journal Article Covering graphs using trees and stars 2003 • Lecture Notes in Computer Science • 2764:24-35 Even G, Garg N, Könemann J, Ravi R, Sinha A
Conference Primal-dual meets local search: Approximating MST's with nonuniform degree bounds 2003 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 389-395 Könemann J, Ravi R
Conference Profit guaranteeing mechanisms for multicast networks 2003 • Proceedings of the ACM Conference on Electronic Commerce • 190-191 Chawla S, Kitchin D, Rajan U, Ravi R, Sinha A
Journal Article Quasi-polynomial time approximation algorithm for low-degree minimum-cost Steiner trees 2003 • Lecture Notes in Computer Science • 2914:289-301 Könemann J, Ravi R
Journal Article Reconstructing edge-disjoint paths 2003 • Operations Research Letters • 31(4):273-276 Conforti M, Hassin R, Ravi R
Journal Article A matter of degree:: Improved approximation algorithms for degree-bounded minimum spanning trees 2002 • SIAM journal on computing (Print) • 31(6):1783-1793 Könemann J, Ravi R
Journal Article An approximation algorithm for minimum-cost vertex-connectivity problems (vol 18, pg 21, 1997) 2002 • Algorithmica • 34(1):98-107 Ravi R, Williamson DP
Conference Approximating <i>k</i>-cuts via network strength 2002 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 621-622 Ravi R, Sinha A
Conference Approximation algorithms for the covering Steiner problem 2002 • Random structures & algorithms (Print) • 20(3):465-482 Konjevod G, Ravi R, Srinivasan A
Conference Bicriteria spanning tree problems 2002 • Lecture Notes in Computer Science • 2462:3-4 Ravi R
Conference Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems 2002 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1000-1001 Ravi R, Williamson DP
Conference Integrated logistics: Approximation algorithms combining facility location and network design 2002 • Lecture Notes in Computer Science • 2337 LNCS:212-229 Ravi R, Sinha A
Conference Randomized approximation algorithms for query optimization problems on two processors 2002 • Lecture Notes in Computer Science • 2461:649-661 Laber E, Parekh O, Ravi R
Journal Article Approximating the single-sink link-installation problem in network design 2001 • SIAM Journal on Optimization • 11(3):595-610 Salman FS, Cheriyan J, Ravi R, Subramanian S
Journal Article Approximation algorithms for degree-constrained minimum-cost network-design problems 2001 • Algorithmica • 31(1):58-78 Ravi R, Marathe MV, Ravi SS, Rosenkrantz DJ, Hunt HB
Journal Article On approximating planar metrics by tree metrics 2001 • Information Processing Letters • 80(4):213-219 Konjevod G, Ravi R, Salman FS
Conference On the approximability of the minimum test collection problem (Extended abstract) 2001 • Lecture Notes in Computer Science • 2161:158-169 Halldórsson BV, Halldórsson MM, Ravi R
Conference On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem 2001 • Lecture Notes in Computer Science • 2081:170-184 Garg N, Khandekar R, Konjevod G, Ravi R, Salman FS, Sinha A
Journal Article Scheduling and reliable lead-time quotation for orders with availability intervals and lead-time sensitive revenues 2001 • Management science • 47(2):264-279 Keskinocak P, Ravi R, Tayur S
Conference A matter of degree: Improved approximation algorithms for degree-bounded minimum spanning trees 2000 • Annual ACM Symposium on Theory of Computing • 537-546 Könemann J, Ravi R
Journal Article A polylogarithmic approximation algorithm for the group Steiner tree problem 2000 • Journal of Algorithms in Cognition, Informatics and Logic • 37(1):66-84 Garg N, Konjevod G, Ravi R
Journal Article A polynomial-time approximation scheme for minimum routing cost spanning trees 2000 • SIAM journal on computing (Print) • 29(3):761-778 Wu BY, Lancia G, Bafna V, Chao KM, Ravi R, Tang CAY
Conference An approximation algorithm for the covering Steiner problem 2000 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 338-344 Konjevod G, Ravi R
Conference Approximation algorithms for a capacitated network design problem 2000 • Lecture Notes in Computer Science • 1913:167-176 Hassin R, Ravi R, Salman FS
Journal Article Approximation algorithms for the multiple knapsack problem with assignment restrictions 2000 • Journal of Combinatorial Optimization • 4(2):171-186 Dawande M, Kalagnanam J, Keskinocak P, Salman FS, Ravi R
