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
Journal Article Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems 2000 • Theoretical Computer Science • 235(1):25-42 Blum A, Konjevod G, Ravi R, Vempala S
Journal Article A constant-factor approximation algorithm for the <i>k</i>-MST problem 1999 • Journal of Computer and System Sciences • 58(1):101-108 Blum A, Ravi R, Vempala S
Conference Approximation algorithms for the traveling purchaser problem and its variants in network design 1999 • Lecture Notes in Computer Science • 1643:29-40 Ravi R, Salman FS
Chapter Flow Improvement and Network Flows with Fixed Costs 1999 • Operations Research Proceedings • 158-167 Krumke SO, Noltemeier H, Schwarz S, Wirth H-C, Ravi R
Conference GESTALT: Genomic Steiner Alignments 1999 • Lecture Notes in Computer Science • 1645:101-114 Lancia G, Ravi R
Journal Article Improving minimum cost spanning trees by upgrading nodes 1999 • Journal of Algorithms in Cognition, Informatics and Logic • 33(1):92-111 Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS, Sundarum R, Wirth HC
Journal Article Improving spanning trees by upgrading nodes 1999 • Theoretical Computer Science • 221(1-2):139-155 Krumke SO, Noltemeier H, Wirth HC, Marathe MV, Ravi R, Ravi SS, Sundaram R
Conference On 2-coverings and 2-packings of laminar families 1999 • Lecture Notes in Computer Science • 1643:510-520 Cheriyan J, Jordán T, Ravi R
Conference A new bound for the 2-Edge Connected Subgraph Problem 1998 • Lecture Notes in Computer Science • 1412:112-125 Carr R, Ravi R
Journal Article Approximating maximum leaf spanning trees in almost linear time 1998 • Journal of Algorithms in Cognition, Informatics and Logic • 29(1):132-141 Lu HI, Ravi R
Journal Article Approximation algorithms for certain network improvement problems 1998 • Journal of Combinatorial Optimization • 2(3):257-288 Krumke SO, Marathe MV, Noltemeier H, Ravi R, Ravi SS
Journal Article Approximation algorithms for multiple sequence alignment under a fixed evolutionary tree 1998 • Discrete Applied Mathematics • 88(1-3):355-366 Ravi R, Kececioglu JD
Preprint Bicriteria Network Design Problems 1998 Marathe MV, Ravi R, Sundaram R, Ravi SS, Rosenkrantz DJ, Hunt HB
Journal Article Bicriteria network design problems 1998 • Journal of Algorithms in Cognition, Informatics and Logic • 28(1):142-171 Marathe MV, Ravi R, Sundaram R, Ravi SS, Rosenkrantz DJ, Hunt HB
Journal Article Optimal circuits for parallel multipliers 1998 • IEEE transactions on computers • 47(3):273-285 Stelling PF, Martel CU, Oklobdzija VG, Ravi R
Conference Polylogarithmic approximation algorithm for the group Steiner tree problem 1998 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 253-259 Garg N, Konjevod G, Ravi R
Conference Polynomial time approximation scheme for minimum routing cost spanning trees 1998 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 21-32 Wu BY, Lancia G, Bafna V, Chao KM, Ravi R, Tang CY
Conference Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems 1998 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 100-105 Blum A, Konjevod G, Ravi R, Vempala S
Journal Article The p-neighbor k-center problem 1998 • Information Processing Letters • 65(3):131-134 Chaudhuri S, Garg N, Ravi R
Conference A fast approximation algorithm for maximum-leaf spanning tree 1997 • Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96) • 351-356 Lu H-I, Ravi R
