The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
R. Ravi: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  110. The Directed Minimum Latency Problem. [Citation Graph (, )][DBLP]


  111. Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. [Citation Graph (, )][DBLP]


  112. Iterative Rounding for Multi-Objective Optimization Problems. [Citation Graph (, )][DBLP]


  113. Minimum Makespan Multi-vehicle Dial-a-Ride. [Citation Graph (, )][DBLP]


  114. Iterative Methods in Combinatorial Optimization. [Citation Graph (, )][DBLP]


  115. Thresholded Covering Algorithms for Robust and Max-min Optimization. [Citation Graph (, )][DBLP]


  116. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. [Citation Graph (, )][DBLP]


  117. Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. [Citation Graph (, )][DBLP]


  118. Tree Embeddings for Two-Edge-Connected Network Design. [Citation Graph (, )][DBLP]


  119. Online and stochastic survivable network design. [Citation Graph (, )][DBLP]


  120. A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. [Citation Graph (, )][DBLP]


  121. Approximation Algorithms for Requirement Cut on Graphs. [Citation Graph (, )][DBLP]


  122. Direct maximum parsimony phylogeny reconstruction from genotype data. [Citation Graph (, )][DBLP]


  123. Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders [Citation Graph (, )][DBLP]


  124. Thresholded Covering Algorithms for Robust and Max-Min Optimization [Citation Graph (, )][DBLP]


  125. Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems [Citation Graph (, )][DBLP]


  126. Line-of-Sight Networks. [Citation Graph (, )][DBLP]


Search in 0.008secs, Finished in 0.015secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002