default search action
R. Ravi 0001
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, PA, USA
Other persons with the same name
- R. Ravi 0002 — Central Electrochemical Research Institute, Karaikudi, India
- R. Ravi 0003 — Francis Xavier Engineering College, Tirunelveli, India
- R. Ravi 0004 — Control Systems Laboratory, Schenectady, MI, USA
- R. Ravi 0005 — Indian Institute of Science Bangalore, School of Automation, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j106]Nikhil Chandak
, Kenny Chour, Sivakumar Rathinam
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions. IEEE Trans Autom. Sci. Eng. 21(4): 5048-5061 (2024) - [c132]Daniel Hathcock, Guy Kortsarz, R. Ravi:
The Telephone k-Multicast Problem. APPROX/RANDOM 2024: 21:1-21:16 - [c131]Zixuan Chen
HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property. ICDE 2024: 235-248 - [c130]Gérard Cornuéjols
Approximately Packing Dijoins via Nowhere-Zero Flows. IPCO 2024: 71-84 - [i47]Zixuan Chen, Subhodeep Mitra, R. Ravi, Wolfgang Gatterbauer:
HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property. CoRR abs/2401.00013 (2024) - [i46]Daniel Hathcock, Guy Kortsarz, R. Ravi:
The Telephone k-Multicast Problem. CoRR abs/2410.01048 (2024) - [i45]Benjamin Moseley, Aidin Niaparast, R. Ravi:
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs. CoRR abs/2410.18535 (2024) - 2023
- [j105]Robert Carr, R. Ravi, Neil Simonetti
A new integer programming formulation of the graphical traveling salesman problem. Math. Program. 197(2): 877-902 (2023) - [j104]Hassene Aissi, Da Qi Chen
Vertex downgrading to minimize connectivity. Math. Program. 199(1): 215-249 (2023) - [j103]Sagnik Das
Order Fulfillment Under Pick Failure in Omnichannel Ship-From-Store Programs. Manuf. Serv. Oper. Manag. 25(2): 508-523 (2023) - [c129]Su Jia, Nishant Oli, Ian Anderson, Paul Duff, Andrew A. Li, R. Ravi:
Short-lived High-volume Bandits. ICML 2023: 14902-14929 - [c128]Da Qi Chen, Lin An, Aidin Niaparast, R. Ravi, Oleksandr Rudenko:
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models. SODA 2023: 2411-2428 - [c127]R. Ravi, Weizhong Zhang, Michael Zlatin:
Approximation Algorithms for Steiner Tree Augmentation Problems. SODA 2023: 2429-2448 - [i44]Su Jia, Andrew A. Li, R. Ravi:
Markdown Pricing Under an Unknown Parametric Demand Model. CoRR abs/2312.15286 (2023) - [i43]Su Jia, Andrew A. Li, R. Ravi, Nishant Oli, Paul Duff, Ian Anderson:
Short-lived High-volume Multi-A(rmed)/B(andits) Testing. CoRR abs/2312.15356 (2023) - [i42]Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi:
Optimal Decision Tree with Noisy Outcomes. CoRR abs/2312.15357 (2023) - 2022
- [j102]Thomas Bosman, Martijn van Ee
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. Algorithmica 84(9): 2597-2621 (2022) - [j101]Ziye Tang
Combinatorial Heuristics for Inventory Routing Problems. INFORMS J. Comput. 34(1): 370-384 (2022) - [j100]Takuro Fukunaga, R. Ravi, Oleksandr Rudenko
Two-level hub Steiner trees. Inf. Process. Lett. 174: 106209 (2022) - [j99]Su Jia
Effective Online Order Acceptance Policies for Omnichannel Fulfillment. Manuf. Serv. Oper. Manag. 24(3): 1650-1663 (2022) - [j98]Takuro Fukunaga, R. Ravi
Approximation algorithm for the 2-stage stochastic matroid base problem. Oper. Res. Lett. 50(2): 129-132 (2022) - [j97]Ojas Parekh, R. Ravi
On small-depth tree augmentations. Oper. Res. Lett. 50(6): 667-673 (2022) - [j96]Jennifer Iglesias
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem. Oper. Res. Lett. 50(6): 693-698 (2022) - [c126]Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? HCOMP 2022: 207-218 - [c125]Su Jia, Andrew A. Li, R. Ravi:
Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model. NeurIPS 2022 - [c124]Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi:
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract). SOCS 2022: 258-260 - [i41]Hassene Aissi, Solal Attias, Da Qi Chen, R. Ravi:
Unit Perturbations in Budgeted Spanning Tree Problems. CoRR abs/2203.03697 (2022) - [i40]R. Ravi, Weizhong Zhang, Michael Zlatin:
New and improved approximation algorithms for Steiner Tree Augmentation Problems. CoRR abs/2207.07983 (2022) - [i39]Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented? CoRR abs/2209.08665 (2022) - 2021
- [j95]D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph. Inf. Process. Lett. 167: 106067 (2021) - [j94]Stylianos Despotakis
The Beneficial Effects of Ad Blockers. Manag. Sci. 67(4): 2096-2125 (2021) - [j93]Arash Haddadan, Alantha Newman, R. Ravi:
Shorter tours and longer detours: uniform covers and a bit beyond. Math. Program. 185(1-2): 245-273 (2021) - [j92]Koen M. J. De Bontridder
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming. Oper. Res. Lett. 49(1): 62-68 (2021) - [j91]Joseph Cheriyan, R. Ravi
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs. Oper. Res. Lett. 49(6): 842-843 (2021) - [c123]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
Using Predicted Weights for Ad Delivery. ACDA 2021: 21-31 - [c122]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. ESA 2021: 59:1-59:17 - [c121]Komal Dhull, Jingyan Wang, Nihar B. Shah, Yuanzhi Li, R. Ravi:
A heuristic for statistical seriation. UAI 2021: 621-631 - [i38]Joseph Cheriyan, R. Ravi, Martin Skutella:
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs. CoRR abs/2104.06210 (2021) - [i37]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu:
Using Predicted Weights for Ad Delivery. CoRR abs/2106.01079 (2021) - [i36]Ojas Parekh, R. Ravi, Michael Zlatin:
On Small-Depth Tree Augmentations. CoRR abs/2111.00148 (2021) - [i35]Da Qi Chen, R. Ravi, Oleksandr Rudenko:
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models. CoRR abs/2111.05450 (2021) - 2020
- [j90]Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev:
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures. Algorithmica 82(9): 2474-2501 (2020) - [c120]Jingyan Wang, Nihar B. Shah, R. Ravi:
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons. AISTATS 2020: 66-76 - [c119]Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex Downgrading to Minimize Connectivity. SWAT 2020: 5:1-5:15 - [c118]Sivakumar Rathinam, R. Ravi, J. Bae, Kaarthik Sundar:
Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem. SWAT 2020: 33:1-33:13 - [i34]D. Ellis Hershkowitz, Gregory Kehne, R. Ravi:
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph. CoRR abs/2011.06108 (2020) - [i33]Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing. CoRR abs/2011.11743 (2020)
2010 – 2019
- 2019
- [j89]Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi:
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces. SIAM J. Discret. Math. 33(1): 454-473 (2019) - [j88]Arda Antikacioglu, Tanvi Bajpai, R. Ravi:
A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms. SIAM J. Math. Data Sci. 1(4): 759-779 (2019) - [j87]Yang Jiao, R. Ravi, Wolfgang Gatterbauer
Algorithms for automatic ranking of participants and tasks in an anonymized contest. Theor. Comput. Sci. 789: 64-76 (2019) - [c117]David Ellis Hershkowitz, R. Ravi, Sahil Singla:
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. APPROX-RANDOM 2019: 4:1-4:19 - [c116]R. Ravi, Oleksandr Rudenko:
Multicommodity Multicast, Wireless and Fast. ESA 2019: 78:1-78:20 - [c115]Su Jia, Viswanath Nagarajan, Fatemeh Navidi, R. Ravi:
Optimal Decision Tree with Noisy Outcomes. NeurIPS 2019: 3298-3308 - [c114]Yang Jiao
Inventory Routing Problem with Facility Location. WADS 2019: 452-465 - [i32]Yang Jiao, R. Ravi:
Inventory Routing Problem with Facility Location. CoRR abs/1905.00148 (2019) - [i31]Jingyan Wang, Nihar B. Shah, R. Ravi:
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons. CoRR abs/1906.04066 (2019) - [i30]Hassene Aissi, Da Qi Chen, R. Ravi:
Downgrading to Minimize Connectivity. CoRR abs/1911.11229 (2019) - 2018
- [c113]Thomas Bosman
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. LATIN 2018: 217-230 - [c112]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi
Plane Gossip: Approximating Rumor Spread in Planar Graphs. LATIN 2018: 611-624 - [i29]D. Ellis Hershkowitz, R. Ravi, Sahil Singla:
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty. CoRR abs/1811.11635 (2018) - [i28]Arda Antikacioglu, Tanvi Bajpai, R. Ravi:
A new system-wide diversity measure for recommendations with efficient algorithms. CoRR abs/1812.03030 (2018) - 2017
- [j86]Refael Hassin, R. Ravi, F. Sibel Salman:
Multiple facility location on a network with linear reliability order of edges. J. Comb. Optim. 34(3): 931-955 (2017) - [j85]Stylianos Despotakis
Expertise in Online Markets. Manag. Sci. 63(11): 3895-3910 (2017) - [j84]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. Math. Oper. Res. 42(3): 876-896 (2017) - [c111]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. APPROX-RANDOM 2017: 17:1-17:13 - [c110]Hassene Aissi, Ali Ridha Mahjoub, R. Ravi:
Randomized Contractions for Multiobjective Minimum Cuts. ESA 2017: 6:1-6:13 - [c109]Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità:
Single-Sink Fractionally Subadditive Network Design. ESA 2017: 46:1-46:13 - [c108]Arda Antikacioglu, R. Ravi:
Post Processing Recommender Systems for Diversity. KDD 2017: 707-716 - [c107]Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
LAST but not Least: Online Spanners for Buy-at-Bulk. SODA 2017: 589-599 - [c106]Yang Jiao, R. Ravi, Wolfgang Gatterbauer
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest. WALCOM 2017: 335-346 - [i27]Arda Antikacioglu, R. Ravi:
Network Flow Based Post Processing for Sales Diversity. CoRR abs/1702.05446 (2017) - [i26]Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen:
On the Integrality Gap of the Prize-Collecting Steiner Forest LP. CoRR abs/1706.06565 (2017) - [i25]Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità:
Single-sink Fractionally Subadditive Network Design. CoRR abs/1707.01487 (2017) - [i24]Jennifer Iglesias, R. Ravi:
Coloring Down: $3/2$-approximation for special cases of the weighted tree augmentation problem. CoRR abs/1707.05240 (2017) - [i23]Arash Haddadan, Alantha Newman, R. Ravi:
Cover and Conquer: Augmenting Decompositions for Connectivity Problems. CoRR abs/1707.05387 (2017) - [i22]Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie:
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times. CoRR abs/1712.05218 (2017) - 2016
- [j83]Jeremy Karp, R. Ravi:
A -approximation algorithm for Graphic TSP in cubic bipartite graphs. Discret. Appl. Math. 209: 164-216 (2016) - [j82]Inge Li Gørtz
Capacitated Vehicle Routing with Nonuniform Speeds. Math. Oper. Res. 41(1): 318-331 (2016) - [j81]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. ACM Trans. Algorithms 12(1): 10:1-10:21 (2016) - [j80]N. Muthukumaran, R. Ravi:
Hardware Implementation of Architecture Techniques for Fast Efficient Lossless Image Compression System. Wirel. Pers. Commun. 90(3): 1291-1315 (2016) - [c105]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Balls and Funnels: Energy Efficient Group-to-Group Anycasts. COCOON 2016: 235-246 - [i21]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Balls and Funnels: Energy Efficient Group-to-Group Anycasts. CoRR abs/1605.07196 (2016) - [i20]Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh:
LAST but not Least: Online Spanners for Buy-at-Bulk. CoRR abs/1611.00052 (2016) - [i19]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Plane Gossip: Approximating rumor spread in planar graphs. CoRR abs/1612.01492 (2016) - [i18]Yang Jiao, R. Ravi, Wolfgang Gatterbauer
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest. CoRR abs/1612.04794 (2016) - [i17]Takuro Fukunaga, R. Ravi, László A. Végh:
Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7). NII Shonan Meet. Rep. 2016 (2016) - 2015
- [j79]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering. Math. Oper. Res. 40(1): 56-79 (2015) - [j78]Daniel Golovin, Vineet Goyal, Valentin Polishchuk, R. Ravi, Mikko Sysikaski:
Improved approximations for two-stage min-cut and shortest path problems under uncertainty. Math. Program. 149(1-2): 167-194 (2015) - [j77]Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer:
Efficient cost-sharing mechanisms for prize-collecting problems. Math. Program. 152(1-2): 147-188 (2015) - [j76]Takuro Fukunaga
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. SIAM J. Comput. 44(5): 1202-1229 (2015) - [j75]Inge Li Gørtz
Minimum Makespan Multi-Vehicle Dial-a-Ride. ACM Trans. Algorithms 11(3): 23:1-23:29 (2015) - [j74]N. Muthukumaran, R. Ravi:
The Performances Analysis of Fast Efficient Lossless Satellite Image Compression and Decompression for Wavelet Based Algorithm. Wirel. Pers. Commun. 81(2): 839-859 (2015) - [c104]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Designing Overlapping Networks for Publish-Subscribe Systems. APPROX-RANDOM 2015: 381-395 - [c103]Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram:
Rumors Across Radio, Wireless, Telephone. FSTTCS 2015: 517-528 - [c102]Arda Antikacioglu, R. Ravi, Srinath Sridhar:
Recommendation Subgraphs for Web Discovery. WWW 2015: 77-87 - 2014
- [j73]Marco Molinaro, R. Ravi:
The Geometry of Online Packing Linear Programs. Math. Oper. Res. 39(1): 46-59 (2014) - [j72]Fabrizio Grandoni
New approaches to multi-objective optimization. Math. Program. 146(1-2): 525-554 (2014) - [j71]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded covering algorithms for robust and max-min optimization. Math. Program. 146(1-2): 583-615 (2014) - [c101]Takuro Fukunaga
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem. APPROX-RANDOM 2014: 209-225 - [c100]Jeremy Karp, R. Ravi:
A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs. APPROX-RANDOM 2014: 284-296 - [c99]Afshin Nikzad, R. Ravi:
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems. ICALP (2) 2014: 568-607 - [c98]Uriel Feige, R. Ravi, Mohit Singh:
Short Tours through Large Linear Forests. IPCO 2014: 273-284 - [c97]Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. WG 2014: 312-323 - [e2]R. Ravi, Inge Li Gørtz
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Lecture Notes in Computer Science 8503, Springer 2014, ISBN 978-3-319-08403-9 [contents] - [i16]Satoru Iwata, Alantha Newman, R. Ravi:
Graph-TSP from Steiner Cycles. CoRR abs/1407.2844 (2014) - [i15]Arda Antikacioglu, R. Ravi, Srinath Sridhar:
Recommendation Subgraphs for Web Discovery. CoRR abs/1409.2042 (2014) - 2013
- [j70]Vineet Goyal, R. Ravi:
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. Oper. Res. Lett. 41(2): 191-196 (2013) - [j69]Satoru Iwata, R. Ravi:
Approximating max-min weighted T-joins. Oper. Res. Lett. 41(4): 321-324 (2013) - [j68]Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz
Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data. IEEE ACM Trans. Comput. Biol. Bioinform. 10(5): 1137-1149 (2013) - [c96]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. Fundamental Problems in Computing 2013: 241-266 - [i14]Jeremy Karp, R. Ravi:
A 9/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs. CoRR abs/1311.3640 (2013) - 2012
- [j67]Isa Emin Hafalir, R. Ravi, Amin Sayedi:
A near Pareto optimal auction with budget constraints. Games Econ. Behav. 74(2): 699-708 (2012) - [j66]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Technical Note - Approximation Algorithms for VRP with Stochastic Demands. Oper. Res. 60(1): 123-127 (2012) - [j65]Viswanath Nagarajan, R. Ravi:
Approximation algorithms for distance constrained vehicle routing problems. Networks 59(2): 209-214 (2012) - [j64]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi:
Online and Stochastic Survivable Network Design. SIAM J. Comput. 41(6): 1649-1672 (2012) - [c95]Ming-Chi Tsai, Guy E. Blelloch, Russell Schwartz
Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data. BCB 2012: 90-97 - [c94]Takuro Fukunaga
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design. FOCS 2012: 263-272 - [c93]Niv Buchbinder
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 - [c92]Marco Molinaro, R. Ravi:
Geometry of Online Packing Linear Programs. ICALP (1) 2012: 701-713 - [c91]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Approximation algorithms for stochastic orienteering. SODA 2012: 1522-1538 - [c90]R. Ravi:
Iterative Methods in Combinatorial Optimization (Invited Talk). STACS 2012: 24-24 - [i13]Takuro Fukunaga, R. Ravi:
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design. CoRR abs/1203.3578 (2012) - [i12]Marco Molinaro, R. Ravi:
Geometry of Online Packing Linear Programs. CoRR abs/1204.5810 (2012) - [i11]Niv Buchbinder
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) - 2011
- [j63]Viswanath Nagarajan, R. Ravi:
The Directed Orienteering Problem. Algorithmica 60(4): 1017-1030 (2011) - [j62]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny. J. Comput. Biol. 18(3): 445-457 (2011) - [j61]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
An Optimization-Based Sampling Scheme for Phylogenetic Trees. J. Comput. Biol. 18(11): 1599-1609 (2011) - [j60]Vineet Goyal, Latife Genç Kaya, R. Ravi:
An FPTAS for minimizing the product of two non-negative linear cost functions. Math. Program. 126(2): 401-405 (2011) - [j59]Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola:
Special Section on Foundations of Computer Science. SIAM J. Comput. 40(3): 770 (2011) - [j58]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha:
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems. SIAM J. Comput. 40(5): 1361-1401 (2011) - [j57]Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. IEEE ACM Trans. Comput. Biol. Bioinform. 8(4): 918-928 (2011) - [c89]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi:
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits. FOCS 2011: 827-836 - [c88]Inge Li Gørtz
Capacitated Vehicle Routing with Non-uniform Speeds. IPCO 2011: 235-247 - [c87]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
An Optimization-Based Sampling Scheme for Phylogenetic Trees. RECOMB 2011: 252-266 - [c86]Brendan Meeder, Brian Karrer, Amin Sayedi, R. Ravi, Christian Borgs
We know who you followed last summer: inferring social link creation times in twitter. WWW 2011: 517-526 - [e1]Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings. Lecture Notes in Computer Science 6845, Springer 2011, ISBN 978-3-642-22934-3 [contents] - [i10]Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi:
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits. CoRR abs/1102.3749 (2011) - [i9]Inge Li Gørtz, Viswanath Nagarajan, R. Ravi:
Minimum Makespan Multi-vehicle Dial-a-Ride. CoRR abs/1102.5450 (2011) - [i8]Marco Molinaro, R. Ravi:
The Query-commit Problem. CoRR abs/1110.0990 (2011) - 2010
- [j56]Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Requirement Cut on Graphs. Algorithmica 56(2): 198-213 (2010) - [j55]Hakan Yildiz, R. Ravi, Wayne Fairey:
Integrated optimization of customer and supplier logistics at Robert Bosch LLC. Eur. J. Oper. Res. 207(1): 456-464 (2010) - [j54]Viswanath Nagarajan, R. Ravi, Mohit Singh:
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. Oper. Res. Lett. 38(3): 156-160 (2010) - [j53]Vineet Goyal, R. Ravi:
A PTAS for the chance-constrained knapsack problem with random item sizes. Oper. Res. Lett. 38(3): 161-164 (2010) - [j52]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
An improved approximation algorithm for requirement cut. Oper. Res. Lett. 38(4): 322-325 (2010) - [j51]R. Ravi, Amitabh Sinha:
Approximation Algorithms for Multicommodity Facility Location Problems. SIAM J. Discret. Math. 24(2): 538-551 (2010) - [j50]Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. ACM Trans. Algorithms 6(2): 41:1-41:21 (2010) - [c85]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded Covering Algorithms for Robust and Max-min Optimization. ICALP (1) 2010: 262-274 - [c84]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. ICALP (1) 2010: 690-701 - [c83]Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. ISBRA 2010: 167-178 - [c82]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. RECOMB 2010: 369-383 - [c81]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi:
Tree Embeddings for Two-Edge-Connected Network Design. SODA 2010: 1521-1538 - [c80]Christian Borgs
Game-Theoretic Models of Information Overload in Social Networks. WAW 2010: 146-161 - [i7]Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems. CoRR abs/1003.0722 (2010) - [i6]Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi:
Capacitated Vehicle Routing with Non-Uniform Speeds. CoRR abs/1012.1850 (2010) - [i5]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets. CoRR abs/1012.4962 (2010)
2000 – 2009
- 2009
- [j49]Alan M. Frieze
Line-of-Sight Networks. Comb. Probab. Comput. 18(1-2): 145-163 (2009) - [c79]Fabrizio Grandoni, R. Ravi, Mohit Singh:
Iterative Rounding for Multi-Objective Optimization Problems. ESA 2009: 95-106 - [c78]Refael Hassin, R. Ravi, F. Sibel Salman
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links. ESA 2009: 275-276 - [c77]Inge Li Gørtz
Minimum Makespan Multi-vehicle Dial-a-Ride. ESA 2009: 540-552 - [c76]R. Ravi:
Iterative Methods in Combinatorial Optimization. FSTTCS 2009: 453-469 - [c75]Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi:
Online and stochastic survivable network design. STOC 2009: 685-694 - [i4]Isa Emin Hafalir, R. Ravi, Amin Sayedi:
Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders. CoRR abs/0903.1450 (2009) - [i3]Anupam Gupta, Viswanath Nagarajan, R. Ravi:
Thresholded Covering Algorithms for Robust and Max-Min Optimization. CoRR abs/0912.1045 (2009) - 2008
- [j48]R. Ravi, Amitabh Sinha:
Approximating k. Eur. J. Oper. Res. 186(1): 77-90 (2008) - [j47]F. Sibel Salman
Solving the Capacitated Local Access Network Design Problem. INFORMS J. Comput. 20(2): 243-254 (2008) - [j46]Giuseppe Lancia
Haplotyping for Disease Association: A Combinatorial Approach. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 245-251 (2008) - [j45]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 323-331 (2008) - [c74]Viswanath Nagarajan, R. Ravi:
The Directed Minimum Latency Problem. APPROX-RANDOM 2008: 193-206 - 2007
- [j44]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz
Direct maximum parsimony phylogeny reconstruction from genotype data. BMC Bioinform. 8 (2007) - [j43]Anupam Gupta, R. Ravi, Amitabh Sinha:
LP Rounding Approximation Algorithms for Stochastic Network Design. Math. Oper. Res. 32(2): 345-364 (2007) - [j42]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. Biol. Bioinform. 4(4): 561-571 (2007) - [c73]Viswanath Nagarajan, R. Ravi:
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems. APPROX-RANDOM 2007: 257-270 - [c72]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k -Forest. ESA 2007: 241-252 - [c71]Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi:
Pricing Tree Access Networks with Connected Backbones. ESA 2007: 498-509 - [c70]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 - [c69]Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany:
Line-of-sight networks. SODA 2007: 968-977 - [c68]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 - [i2]Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi:
Dial a Ride from k-forest. CoRR abs/0707.0648 (2007) - 2006
- [j41]R. Ravi, Amitabh Sinha:
Approximation Algorithms for Problems Combining Facility Location and Network Design. Oper. Res. 54(1): 73-81 (2006) - [j40]R. Ravi, Amitabh Sinha:
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. Math. Program. 108(1): 97-114 (2006) - [j39]Kedar Dhamdhere, Anupam Gupta
Approximation Algorithms for Minimizing Average Distortion. Theory Comput. Syst. 39(1): 93-111 (2006) - [j38]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) - [c67]Viswanath Nagarajan, R. Ravi:
Minimum Vehicle Routing with a Common Deadline. APPROX-RANDOM 2006: 212-223 - [c66]R. Ravi, Mohit Singh:
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs. ICALP (1) 2006: 169-180 - [c65]Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. ICALP (1) 2006: 667-678 - [c64]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 - [c63]R. Ravi:
Matching Based Augmentations for Approximating Connectivity Problems. LATIN 2006: 13-24 - [c62]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 - [c61]Shuchi Chawla, Jason D. Hartline, Uday Rajan, R. Ravi:
Bayesian Optimal No-Deficit Mechanism Design. WINE 2006: 136-148 - 2005
- [j37]Jochen Könemann, R. Ravi:
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds. SIAM J. Comput. 34(3): 763-773 (2005) - [c60]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha:
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization. APPROX-RANDOM 2005: 86-98 - [c59]Viswanath Nagarajan, R. Ravi:
Approximation Algorithms for Requirement Cut on Graphs. APPROX-RANDOM 2005: 209-220 - [c58]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 - [c57]Kedar Dhamdhere, R. Ravi, Mohit Singh:
On Two-Stage Stochastic Minimum Spanning Trees. IPCO 2005: 321-334 - [c56]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 - [c55]Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo:
Finding effective support-tree preconditioners. SPAA 2005: 176-185 - 2004
- [j36]Refael Hassin, R. Ravi, F. Sibel Salman
Approximation Algorithms for a Capacitated Network Design Problem. Algorithmica 38(3): 417-431 (2004) - [j35]Elias Dahlhaus, Peter Dankelmann
A linear-time algorithm to compute a MAD tree of an interval graph. Inf. Process. Lett. 89(5): 255-259 (2004) - [j34]Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi:
Approximation algorithms for finding low-degree subgraphs. Networks 44(3): 203-215 (2004) - [j33]Guy Even, Naveen Garg
Min-max tree covers of graphs. Oper. Res. Lett. 32(4): 309-315 (2004) - [c54]Vittorio Bilò
On the Crossing Spanning Tree Problem. APPROX-RANDOM 2004: 51-60 - [c53]Anupam Gupta, R. Ravi, Amitabh Sinha:
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design. FOCS 2004: 218-227 - [c52]R. Ravi, Amitabh Sinha:
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems. IPCO 2004: 101-115 - [c51]Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha:
Worst-case payoffs of a location game. EC 2004: 244-245 - [c50]R. Ravi, Amitabh Sinha:
Multicommodity facility location. SODA 2004: 342-349 - [c49]Kedar Dhamdhere, Anupam Gupta, R. Ravi:
Approximation Algorithms for Minimizing Average Distortion. STACS 2004: 234-245 - [c48]Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha:
Boosted sampling: approximation algorithms for stochastic optimization. STOC 2004: 417-426 - 2003
- [j32]Koen M. J. De Bontridder, Bjarni V. Halldórsson
Approximation algorithms for the test cover problem. Math. Program. 98(1-3): 477-491 (2003) - [j31]Michele Conforti, Refael Hassin, R. Ravi:
Reconstructing edge-disjoint paths. Oper. Res. Lett. 31(3): 273-276 (2003) - [c47]Jochen Könemann, R. Ravi:
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees. FSTTCS 2003: 289-301 - [c46]Guy Even, Naveen Garg
Covering Graphs Using Trees and Stars. RANDOM-APPROX 2003: 24-35 - [c45]Shuchi Chawla, D. Kitchin, Uday Rajan, R. Ravi, Amitabh Sinha:
Profit guaranteeing mechanisms for multicast networks. EC 2003: 190-191 - [c44]Jochen Könemann, R. Ravi:
Primal-dual meets local search: approximating MST's with nonuniform degree bounds. STOC 2003: 389-395 - 2002
- [j30]R. Ravi, David P. Williamson:
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica 34(1): 98-107 (2002) - [j29]Goran Konjevod
Approximation algorithms for the covering Steiner problem. Random Struct. Algorithms 20(3): 465-482 (2002) - [j28]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) - [c43]R. Ravi:
Bicriteria Spanning Tree Problems. APPROX 2002: 3-4 - [c42]Eduardo Sany Laber, Ojas Parekh, R. Ravi:
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors. ESA 2002: 649-661 - [c41]R. Ravi, Amitabh Sinha II:
Approximating k-cuts via network strength. SODA 2002: 621-622 - [c40]R. Ravi, David P. Williamson:
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems. SODA 2002: 1000-1001 - 2001
- [j27]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) - [j26]Goran Konjevod
On approximating planar metrics by tree metrics. Inf. Process. Lett. 80(4): 213-219 (2001) - [j25]Pinar Keskinocak, R. Ravi, Sridhar R. Tayur:
Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues. Manag. Sci. 47(2): 264-279 (2001) - [j24]F. Sibel Salman
Approximating the Single-Sink Link-Installation Problem in Network Design. SIAM J. Optim. 11(3): 595-610 (2001) - [c39]Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi:
On the Approximability of the Minimum Test Collection Problem. ESA 2001: 158-169 - [c38]Naveen Garg
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem. IPCO 2001: 170-184 - 2000
- [j23]Naveen Garg
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. J. Algorithms 37(1): 66-84 (2000) - [j22]Milind Dawande
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions. J. Comb. Optim. 4(2): 171-186 (2000) - [j21]Avrim Blum, Goran Konjevod
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. Theor. Comput. Sci. 235(1): 25-42 (2000) - [c37]Refael Hassin, R. Ravi, F. Sibel Salman:
Approximation algorithms for a capacitated network design problem. APPROX 2000: 167-176 - [c36]Goran Konjevod, R. Ravi:
An approximation algorithm for the covering Steiner problem. SODA 2000: 338-344 - [c35]Jochen Könemann, R. Ravi:
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees. STOC 2000: 537-546
1990 – 1999
- 1999
- [j20]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) - [j19]Avrim Blum, R. Ravi, Santosh S. Vempala:
A Constant-Factor Approximation Algorithm for the k-MST Problem. J. Comput. Syst. Sci. 58(1): 101-108 (1999) - [j18]Bang Ye Wu, Giuseppe Lancia
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SIAM J. Comput. 29(3): 761-778 (1999) - [j17]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) - [c34]Giuseppe Lancia
GESTALT: Genomic Steiner Alignments. CPM 1999: 101-114 - [c33]R. Ravi, F. Sibel Salman:
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design. ESA 1999: 29-40 - [c32]Joseph Cheriyan, Tibor Jordán, R. Ravi:
On 2-Coverings and 2-Packings of Laminar Families. ESA 1999: 510-520 - [c31]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
Redeeming Nested Dissection: Parallelism Implies Fill. PP 1999 - 1998
- [j16]R. Ravi, John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. Discret. Appl. Math. 88(1-3): 355-366 (1998) - [j15]Shiva Chaudhuri, Naveen Garg
The p-Neighbor k-Center Problem. Inf. Process. Lett. 65(3): 131-134 (1998) - [j14]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) - [j13]Hsueh-I Lu, R. Ravi:
Approximating Maximum Leaf Spanning Trees in Almost Linear Time. J. Algorithms 29(1): 132-141 (1998) - [j12]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) - [j11]Paul F. Stelling, Charles U. Martel, Vojin G. Oklobdzija, R. Ravi:
Optimal Circuits for Parallel Multipliers. IEEE Trans. Computers 47(3): 273-285 (1998) - [c30]Robert Carr, R. Ravi:
A New Bound for the 2-Edge Connected Subgraph Problem. IPCO 1998: 112-125 - [c29]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 - [c28]Naveen Garg, Goran Konjevod, R. Ravi:
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem. SODA 1998: 253-259 - [c27]Avrim Blum, Goran Konjevod
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. STOC 1998: 100-105 - [i1]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) - 1997
- [j10]R. Ravi, David P. Williamson:
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. Algorithmica 18(1): 21-43 (1997) - [c26]Amir Ben-Dor, Giuseppe Lancia
Banishing Bias from Consensus Sequences. CPM 1997: 247-261 - [c25]Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi:
Network improvement problems. Network Design: Connectivity and Facilities Location 1997: 247-268 - [c24]Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Improved results on service-constrained network design problems. Network Design: Connectivity and Facilities Location 1997: 269-276 - [c23]Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi:
Parallelizing Elimination Orders with Linear Fill. FOCS 1997: 274-283 - [c22]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 - [c21]Hsueh-I Lu, R. Ravi:
A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree. ISPAN 1997: 351-356 - [c20]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 - 1996
- [j9]Vineet Bafna, Babu O. Narayanan, R. Ravi:
Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles). Discret. Appl. Math. 71(1-3): 41-53 (1996) - [j8]Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Service-Constrained Network Design Problems. Nord. J. Comput. 3(4): 367-387 (1996) - [j7]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Spanning Trees - Short or Small. SIAM J. Discret. Math. 9(2): 178-200 (1996) - [c19]Avrim Blum, R. Ravi, Santosh S. Vempala:
A Constant-factor Approximation Algorithm for the k MST Problem (Extended Abstract). STOC 1996: 442-448 - [c18]Madhav V. Marathe, R. Ravi, Ravi Sundaram:
Service-Constrained Network Design Problems. SWAT 1996: 28-40 - [c17]R. Ravi, Michel X. Goemans:
The Constrained Minimum Spanning Tree Problem (Extended Abstract). SWAT 1996: 66-75 - 1995
- [j6]Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi:
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications. Comb. 15(2): 187-202 (1995) - [j5]Philip N. Klein, R. Ravi:
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees. J. Algorithms 19(1): 104-115 (1995) - [j4]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) - [c16]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 - [c15]Vineet Bafna, S. Muthukrishnan, R. Ravi:
Computing Similarity between RNA Strings. CPM 1995: 1-16 - [c14]R. Ravi, John D. Kececioglu:
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree. CPM 1995: 330-339 - [c13]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 - [c12]R. Ravi:
David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems. SODA 1995: 332-341 - [c11]John D. Kececioglu, R. Ravi:
Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation. SODA 1995: 604-613 - [c10]Vineet Bafna, Babu O. Narayanan, R. Ravi:
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles). WADS 1995: 506-517 - 1994
- [j3]R. Ravi:
A Primal-Dual Approximation Algorithm for the Steiner Forest Problem. Inf. Process. Lett. 50(4): 185-190 (1994) - [c9]R. Ravi:
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract). FOCS 1994: 202-213 - [c8]R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi:
Spanning Trees Short or Small. SODA 1994: 546-555 - 1993
- [c7]Philip N. Klein, R. Ravi:
When cycles collapse: A general approximation technique for constrained two-connectivity problems. IPCO 1993: 39-55 - [c6]Philip N. Klein, R. Ravi:
A nearly best-possible approximation algorithm for node-weighted Steiner trees. IPCO 1993: 323-332 - [c5]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
- [j2]Madhav V. Marathe, R. Ravi, C. Pandu Rangan:
Generalized Vertex Covering in Interval Graphs. Discret. Appl. Math. 39(1): 87-93 (1992) - [j1]R. Ravi, Madhav V. Marathe, C. Pandu Rangan:
An optimal algorithm to solve the all-pair shortest path problem on interval graphs. Networks 22(1): 21-35 (1992) - [c4]R. Ravi, Balaji Raghavachari, Philip N. Klein:
Approximation Through Local Optimality: Designing Networks with Small Degree. FSTTCS 1992: 279-290 - 1991
- [c3]R. Ravi, Ajit Agrawal, Philip N. Klein:
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion. ICALP 1991: 751-762 - [c2]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
- [c1]Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao:
Approximation through Multicommodity Flow. FOCS 1990: 726-737
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: