Journal Article Min-max tree covers of graphs 2004 • Operations Research Letters • 32(4):309-315 Even G, Garg N, Könemann J, Ravi R, Sinha A
Conference Multicommodity Facility Location 2004 • Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms • 15:335-342 Ravi R, Sinha A
Journal Article On the crossing spanning tree problem 2004 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 3122:51-60 Bilò V, Goyal V, Ravi R, Singh M
Journal Article Approximation Algorithms for Robust Covering Problems with Chance Constraints 2003 Goyal V, Ravi R
Conference Approximation algorithms for the test cover problem 2003 • Mathematical programming • 98(1-3):477-491 De Bontridder KMJ, Halldórsson BV, Halldórsson MM, Hurkens CAJ, Lenstra JK, Ravi R, Stougie L
Journal Article Covering graphs using trees and stars 2003 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 2764:24-35 Even G, Garg N, Könemann J, Ravi R, Sinha A
Conference Primal-dual meets local search 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 4th ACM conference on Electronic commerce - EC '03 Chawla S, Kitchin D, Rajan U, Ravi R, Sinha A
Conference Profit guaranteeing mechanisms for multicast networks 2003 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 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 THIRTEENTH 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 2462:3-4 Ravi R
Conference Erratum: An approximation algorithm for minimum-cost vertex-connectivity problems 2002 • PROCEEDINGS OF THE THIRTEENTH 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 2337:212-229 Ravi R, Sinha A
Conference Randomized approximation algorithms for query optimization problems on two processors 2002 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 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 HBIII
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 2001 • Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 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 (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) • 2081:170-184 Garg N, Khandekar R, Konjevod G, Ravi R, Salman FS, Sinha A
