| 2009 |
|---|
| 118 | EE | I. Hafalir,
R. Ravi,
A. Sayedi:
Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders
CoRR abs/0903.1450: (2009) |
| 117 | EE | Alan M. Frieze,
Jon M. Kleinberg,
R. Ravi,
Warren Debany:
Line-of-Sight Networks.
Combinatorics, Probability & Computing 18(1-2): 145-163 (2009) |
| 2008 |
|---|
| 116 | EE | Viswanath Nagarajan,
R. Ravi:
The Directed Minimum Latency Problem.
APPROX-RANDOM 2008: 193-206 |
| 115 | EE | R. Ravi,
Amitabh Sinha:
Approximating k.
European Journal of Operational Research 186(1): 77-90 (2008) |
| 114 | EE | Giuseppe Lancia,
R. Ravi,
Romeo Rizzi:
Haplotyping for Disease Association: A Combinatorial Approach.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 245-251 (2008) |
| 113 | EE | Srinath Sridhar,
Fumei Lam,
Guy E. Blelloch,
R. Ravi,
Russell Schwartz:
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 323-331 (2008) |
| 112 | EE | F. Sibel Salman,
R. Ravi,
John N. Hooker:
Solving the Capacitated Local Access Network Design Problem.
INFORMS Journal on Computing 20(2): 243-254 (2008) |
| 2007 |
|---|
| 111 | EE | Viswanath Nagarajan,
R. Ravi:
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems.
APPROX-RANDOM 2007: 257-270 |
| 110 | EE | Anupam Gupta,
MohammadTaghi Hajiaghayi,
Viswanath Nagarajan,
R. Ravi:
Dial a Ride from k -Forest.
ESA 2007: 241-252 |
| 109 | EE | Vineet Goyal,
Anupam Gupta,
Stefano Leonardi,
R. Ravi:
Pricing Tree Access Networks with Connected Backbones.
ESA 2007: 498-509 |
| 108 | EE | Srinath Sridhar,
Fumei Lam,
Guy E. Blelloch,
R. Ravi,
Russell Schwartz:
Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming.
ISBRA 2007: 37-48 |
| 107 | EE | Anupam Gupta,
Jochen Könemann,
Stefano Leonardi,
R. Ravi,
Guido Schäfer:
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.
SODA 2007: 1153-1162 |
| 106 | EE | Alan M. Frieze,
Jon M. Kleinberg,
R. Ravi,
Warren Debany:
Line-of-sight networks.
SODA 2007: 968-977 |
| 105 | EE | Anupam Gupta,
MohammadTaghi Hajiaghayi,
Viswanath Nagarajan,
R. Ravi:
Dial a Ride from k-forest
CoRR abs/0707.0648: (2007) |
| 104 | EE | Srinath Sridhar,
Kedar Dhamdhere,
Guy E. Blelloch,
Eran Halperin,
R. Ravi,
Russell Schwartz:
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.
IEEE/ACM Trans. Comput. Biology Bioinform. 4(4): 561-571 (2007) |
| 2006 |
|---|
| 103 | EE | Viswanath Nagarajan,
R. Ravi:
Minimum Vehicle Routing with a Common Deadline.
APPROX-RANDOM 2006: 212-223 |
| 102 | EE | R. Ravi,
Mohit Singh:
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.
ICALP (1) 2006: 169-180 |
| 101 | EE | Guy E. Blelloch,
Kedar Dhamdhere,
Eran Halperin,
R. Ravi,
Russell Schwartz,
Srinath Sridhar:
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.
ICALP (1) 2006: 667-678 |
| 100 | EE | Srinath Sridhar,
Kedar Dhamdhere,
Guy E. Blelloch,
Eran Halperin,
R. Ravi,
Russell Schwartz:
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.
International Conference on Computational Science (2) 2006: 799-806 |
| 99 | EE | R. Ravi:
Matching Based Augmentations for Approximating Connectivity Problems.
LATIN 2006: 13-24 |
| 98 | EE | Daniel Golovin,
Vineet Goyal,
R. Ravi:
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
STACS 2006: 206-217 |
| 97 | EE | Shuchi Chawla,
Jason D. Hartline,
Uday Rajan,
R. Ravi:
Bayesian Optimal No-Deficit Mechanism Design.
WINE 2006: 136-148 |
| 96 | EE | Thirumalai Parthiban,
R. Ravi,
G. T. Parthiban:
Potential monitoring system for corrosion of steel in concrete.
Advances in Engineering Software 37(6): 375-381 (2006) |
| 95 | EE | R. Ravi,
Amitabh Sinha:
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
Math. Program. 108(1): 97-114 (2006) |
| 94 | EE | Shuchi Chawla,
Uday Rajan,
R. Ravi,
Amitabh Sinha:
Min-Max payoffs in a two-player location game.
Oper. Res. Lett. 34(5): 499-507 (2006) |
| 93 | EE | Kedar Dhamdhere,
Anupam Gupta,
R. Ravi:
Approximation Algorithms for Minimizing Average Distortion.
Theory Comput. Syst. 39(1): 93-111 (2006) |
| 2005 |
|---|
| 92 | EE | Viswanath Nagarajan,
R. Ravi:
Approximation Algorithms for Requirement Cut on Graphs.
APPROX-RANDOM 2005: 209-220 |
| 91 | EE | Anupam Gupta,
Martin Pál,
R. Ravi,
Amitabh Sinha:
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.
APPROX-RANDOM 2005: 86-98 |
| 90 | EE | Kedar Dhamdhere,
Vineet Goyal,
R. Ravi,
Mohit Singh:
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.
FOCS 2005: 367-378 |
| 89 | EE | Kedar Dhamdhere,
R. Ravi,
Mohit Singh:
On Two-Stage Stochastic Minimum Spanning Trees.
IPCO 2005: 321-334 |
| 88 | EE | Mihai Badoiu,
Kedar Dhamdhere,
Anupam Gupta,
Yuri Rabinovich,
Harald Räcke,
R. Ravi,
Anastasios Sidiropoulos:
Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
SODA 2005: 119-128 |
| 87 | EE | Bruce M. Maggs,
Gary L. Miller,
Ojas Parekh,
R. Ravi,
Shan Leung Maverick Woo:
Finding effective support-tree preconditioners.
SPAA 2005: 176-185 |
| 86 | EE | Jochen Könemann,
R. Ravi:
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds.
SIAM J. Comput. 34(3): 763-773 (2005) |
| 2004 |
|---|
| 85 | EE | Shuchi Chawla,
Uday Rajan,
R. Ravi,
Amitabh Sinha:
Worst-case payoffs of a location game.
ACM Conference on Electronic Commerce 2004: 244-245 |
| 84 | EE | Vittorio Bilò,
Vineet Goyal,
R. Ravi,
Mohit Singh:
On the Crossing Spanning Tree Problem.
APPROX-RANDOM 2004: 51-60 |
| 83 | EE | Anupam Gupta,
R. Ravi,
Amitabh Sinha:
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.
FOCS 2004: 218-227 |
| 82 | EE | R. Ravi,
Amitabh Sinha:
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
IPCO 2004: 101-115 |
| 81 | EE | R. Ravi,
Amitabh Sinha:
Multicommodity facility location.
SODA 2004: 342-349 |
| 80 | EE | Kedar Dhamdhere,
Anupam Gupta,
R. Ravi:
Approximation Algorithms for Minimizing Average Distortion.
STACS 2004: 234-245 |
| 79 | EE | Anupam Gupta,
Martin Pál,
R. Ravi,
Amitabh Sinha:
Boosted sampling: approximation algorithms for stochastic optimization.
STOC 2004: 417-426 |
| 78 | EE | Elias Dahlhaus,
Peter Dankelmann,
R. Ravi:
A linear-time algorithm to compute a MAD tree of an interval graph.
Inf. Process. Lett. 89(5): 255-259 (2004) |
| 77 | EE | Philip N. Klein,
Radha Krishnan,
Balaji Raghavachari,
R. Ravi:
Approximation algorithms for finding low-degree subgraphs.
Networks 44(3): 203-215 (2004) |
| 76 | EE | Guy Even,
Naveen Garg,
Jochen Könemann,
R. Ravi,
Amitabh Sinha:
Min-max tree covers of graphs.
Oper. Res. Lett. 32(4): 309-315 (2004) |
| 2003 |
|---|
| 75 | EE | Shuchi Chawla,
D. Kitchin,
Uday Rajan,
R. Ravi,
Amitabh Sinha:
Profit guaranteeing mechanisms for multicast networks.
ACM Conference on Electronic Commerce 2003: 190-191 |
| 74 | EE | Jochen Könemann,
R. Ravi:
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.
FSTTCS 2003: 289-301 |
| 73 | EE | Guy Even,
Naveen Garg,
Jochen Könemann,
R. Ravi,
Amitabh Sinha:
Covering Graphs Using Trees and Stars.
RANDOM-APPROX 2003: 24-35 |
| 72 | EE | Jochen Könemann,
R. Ravi:
Primal-dual meets local search: approximating MST's with nonuniform degree bounds.
STOC 2003: 389-395 |
| 71 | EE | Refael Hassin,
R. Ravi,
F. Sibel Salman:
Approximation Algorithms for a Capacitated Network Design Problem.
Algorithmica 38(3): 417-431 (2003) |
| 70 | EE | Michele Conforti,
Refael Hassin,
R. Ravi:
Reconstructing edge-disjoint paths.
Oper. Res. Lett. 31(3): 273-276 (2003) |
| 2002 |
|---|
| 69 | EE | R. Ravi:
Bicriteria Spanning Tree Problems.
APPROX 2002: 3-4 |
| 68 | EE | Eduardo Sany Laber,
Ojas Parekh,
R. Ravi:
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
ESA 2002: 649-661 |
| 67 | EE | R. Ravi,
David P. Williamson:
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems.
SODA 2002: 1000-1001 |
| 66 | EE | R. Ravi,
Amitabh Sinha II:
Approximating k-cuts via network strength.
SODA 2002: 621-622 |
| 65 | EE | R. Ravi,
David P. Williamson:
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
Algorithmica 34(1): 98-107 (2002) |
| 64 | EE | Goran Konjevod,
R. Ravi,
Aravind Srinivasan:
Approximation algorithms for the covering Steiner problem.
Random Struct. Algorithms 20(3): 465-482 (2002) |
| 63 | EE | Jochen Könemann,
R. Ravi:
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees.
SIAM J. Comput. 31(6): 1783-1793 (2002) |
| 2001 |
|---|
| 62 | EE | Bjarni V. Halldórsson,
Magnús M. Halldórsson,
R. Ravi:
On the Approximability of the Minimum Test Collection Problem.
ESA 2001: 158-169 |
| 61 | EE | Naveen Garg,
Rohit Khandekar,
Goran Konjevod,
R. Ravi,
F. Sibel Salman,
Amitabh Sinha II:
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
IPCO 2001: 170-184 |
| 60 | EE | R. Ravi,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Algorithmica 31(1): 58-78 (2001) |
| 59 | EE | Goran Konjevod,
R. Ravi,
F. Sibel Salman:
On approximating planar metrics by tree metrics.
Inf. Process. Lett. 80(4): 213-219 (2001) |
| 2000 |
|---|
| 58 | EE | Refael Hassin,
R. Ravi,
F. Sibel Salman:
Approximation algorithms for a capacitated network design problem.
APPROX 2000: 167-176 |
| 57 | EE | Goran Konjevod,
R. Ravi:
An approximation algorithm for the covering Steiner problem.
SODA 2000: 338-344 |
| 56 | EE | Jochen Könemann,
R. Ravi:
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees.
STOC 2000: 537-546 |
| 55 | | Naveen Garg,
Goran Konjevod,
R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
J. Algorithms 37(1): 66-84 (2000) |
| 54 | | Milind Dawande,
Jayant Kalagnanam,
Pinar Keskinocak,
F. Sibel Salman,
R. Ravi:
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim. 4(2): 171-186 (2000) |
| 53 | EE | Avrim Blum,
Goran Konjevod,
R. Ravi,
Santosh Vempala:
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.
Theor. Comput. Sci. 235(1): 25-42 (2000) |
| 1999 |
|---|
| 52 | EE | Giuseppe Lancia,
R. Ravi:
GESTALT: Genomic Steiner Alignments.
CPM 1999: 101-114 |
| 51 | EE | R. Ravi,
F. Sibel Salman:
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
ESA 1999: 29-40 |
| 50 | EE | Joseph Cheriyan,
Tibor Jordán,
R. Ravi:
On 2-Coverings and 2-Packings of Laminar Families.
ESA 1999: 510-520 |
| 49 | | Claudson F. Bornstein,
Bruce M. Maggs,
Gary L. Miller,
R. Ravi:
Redeeming Nested Dissection: Parallelism Implies Fill.
PPSC 1999 |
| 48 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms 33(1): 92-111 (1999) |
| 47 | | Avrim Blum,
R. Ravi,
Santosh Vempala:
A Constant-Factor Approximation Algorithm for the k-MST Problem.
J. Comput. Syst. Sci. 58(1): 101-108 (1999) |
| 46 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput. 29(3): 761-778 (1999) |
| 45 | EE | Sven Oliver Krumke,
Hartmut Noltemeier,
Madhav V. Marathe,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci. 221(1-2): 139-155 (1999) |
| 1998 |
|---|
| 44 | EE | Robert Carr,
R. Ravi:
A New Bound for the 2-Edge Connected Subgraph Problem.
IPCO 1998: 112-125 |
| 43 | | Bang Ye Wu,
Giuseppe Lancia,
Vineet Bafna,
Kun-Mao Chao,
R. Ravi,
Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA 1998: 21-32 |
| 42 | | Naveen Garg,
Goran Konjevod,
R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
SODA 1998: 253-259 |
| 41 | EE | Avrim Blum,
Goran Konjevod,
R. Ravi,
Santosh Vempala:
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems.
STOC 1998: 100-105 |
| 40 | EE | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems
CoRR cs.CC/9809103: (1998) |
| 39 | EE | R. Ravi,
John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
Discrete Applied Mathematics 88(1-3): 355-366 (1998) |
| 38 | | Paul F. Stelling,
Charles U. Martel,
Vojin G. Oklobdzija,
R. Ravi:
Optimal Circuits for Parallel Multipliers.
IEEE Trans. Computers 47(3): 273-285 (1998) |
| 37 | EE | Shiva Chaudhuri,
Naveen Garg,
R. Ravi:
The p-Neighbor k-Center Problem.
Inf. Process. Lett. 65(3): 131-134 (1998) |
| 36 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems.
J. Algorithms 28(1): 142-171 (1998) |
| 35 | | Hsueh-I Lu,
R. Ravi:
Approximating Maximum Leaf Spanning Trees in Almost Linear Time.
J. Algorithms 29(1): 132-141 (1998) |
| 34 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi:
Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim. 2(3): 257-288 (1998) |
| 1997 |
|---|
| 33 | | Amir Ben-Dor,
Giuseppe Lancia,
Jennifer Perone,
R. Ravi:
Banishing Bias from Consensus Sequences.
CPM 1997: 247-261 |
| 32 | EE | Claudson F. Bornstein,
Bruce M. Maggs,
Gary L. Miller,
R. Ravi:
Parallelizing Elimination Orders with Linear Fill.
FOCS 1997: 274-283 |
| 31 | | Sven Oliver Krumke,
Madhav V. Marathe,
Hartmut Noltemeier,
R. Ravi,
S. S. Ravi,
Ravi Sundaram,
Hans-Christoph Wirth:
Improving Spanning Trees by Upgrading Nodes.
ICALP 1997: 281-291 |
| 30 | EE | Hsueh-I Lu,
R. Ravi:
A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.
ISPAN 1997: 351-356 |
| 29 | | F. Sibel Salman,
Joseph Cheriyan,
R. Ravi,
S. Subramanian:
Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.
SODA 1997: 619-628 |
| 28 | | R. Ravi,
David P. Williamson:
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
Algorithmica 18(1): 21-43 (1997) |
| 1996 |
|---|
| 27 | EE | Avrim Blum,
R. Ravi,
Santosh Vempala:
A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract).
STOC 1996: 442-448 |
| 26 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram:
Service-Constrained Network Design Problems.
SWAT 1996: 28-40 |
| 25 | | R. Ravi,
Michel X. Goemans:
The Constrained Minimum Spanning Tree Problem (Extended Abstract).
SWAT 1996: 66-75 |
| 24 | EE | Vineet Bafna,
Babu O. Narayanan,
R. Ravi:
Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles).
Discrete Applied Mathematics 71(1-3): 41-53 (1996) |
| 23 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram:
Service-Constrained Network Design Problems.
Nord. J. Comput. 3(4): 367-387 (1996) |
| 22 | EE | R. Ravi,
Ravi Sundaram,
Madhav V. Marathe,
Daniel J. Rosenkrantz,
S. S. Ravi:
Spanning Trees - Short or Small.
SIAM J. Discrete Math. 9(2): 178-200 (1996) |
| 1995 |
|---|
| 21 | | Vineet Bafna,
S. Muthukrishnan,
R. Ravi:
Computing Similarity between RNA Strings.
CPM 1995: 1-16 |
| 20 | | R. Ravi,
John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
CPM 1995: 330-339 |
| 19 | | Madhav V. Marathe,
R. Ravi,
Ravi Sundaram,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Bicriteria Network Design Problems.
ICALP 1995: 487-498 |
| 18 | EE | Charles U. Martel,
Vojin G. Oklobdzija,
R. Ravi,
Paul F. Stelling:
Design Strategies for Optimal Multiplier Circuits.
IEEE Symposium on Computer Arithmetic 1995: 42-49 |
| 17 | | R. Ravi:
David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
SODA 1995: 332-341 |
| 16 | | John D. Kececioglu,
R. Ravi:
Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation.
SODA 1995: 604-613 |
| 15 | | Vineet Bafna,
Babu O. Narayanan,
R. Ravi:
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles).
WADS 1995: 506-517 |
| 14 | | Philip N. Klein,
Satish Rao,
Ajit Agrawal,
R. Ravi:
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.
Combinatorica 15(2): 187-202 (1995) |
| 13 | | Philip N. Klein,
R. Ravi:
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees.
J. Algorithms 19(1): 104-115 (1995) |
| 12 | | Ajit Agrawal,
Philip N. Klein,
R. Ravi:
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks.
SIAM J. Comput. 24(3): 440-456 (1995) |
| 1994 |
|---|
| 11 | | R. Ravi:
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract)
FOCS 1994: 202-213 |
| 10 | | R. Ravi,
Ravi Sundaram,
Madhav V. Marathe,
Daniel J. Rosenkrantz,
S. S. Ravi:
Spanning Trees Short or Small.
SODA 1994: 546-555 |
| 9 | | R. Ravi:
A Primal-Dual Approximation Algorithm for the Steiner Forest Problem.
Inf. Process. Lett. 50(4): 185-190 (1994) |
| 1993 |
|---|
| 8 | | Philip N. Klein,
R. Ravi:
A nearly best-possible approximation algorithm for node-weighted Steiner trees.
IPCO 1993: 323-332 |
| 7 | | Philip N. Klein,
R. Ravi:
When cycles collapse: A general approximation technique for constrained two-connectivity problems.
IPCO 1993: 39-55 |
| 6 | EE | R. Ravi,
Madhav V. Marathe,
S. S. Ravi,
Daniel J. Rosenkrantz,
Harry B. Hunt III:
Many birds with one stone: multi-objective approximation algorithms.
STOC 1993: 438-447 |
| 1992 |
|---|
| 5 | | R. Ravi,
Balaji Raghavachari,
Philip N. Klein:
Approximation Through Local Optimality: Designing Networks with Small Degree.
FSTTCS 1992: 279-290 |
| 4 | EE | Madhav V. Marathe,
R. Ravi,
C. Pandu Rangan:
Generalized Vertex Covering in Interval Graphs.
Discrete Applied Mathematics 39(1): 87-93 (1992) |
| 1991 |
|---|
| 3 | | R. Ravi,
Ajit Agrawal,
Philip N. Klein:
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion.
ICALP 1991: 751-762 |
| 2 | | Ajit Agrawal,
Philip N. Klein,
R. Ravi:
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
STOC 1991: 134-144 |
| 1990 |
|---|
| 1 | | Philip N. Klein,
Ajit Agrawal,
R. Ravi,
Satish Rao:
Approximation through Multicommodity Flow
FOCS 1990: 726-737 |
