R. Ravi

301 papers A* 47A 19B 25C 2Misc 2Journal 165Unranked 39
YearRankTypeTitle / Venue / Authors
2026 J jnl
The Steiner path aggregation problem.
Inf. Process. Lett.
Da Qi Chen, Daniel Hathcock, D. Ellis Hershkowitz, R. Ravi
2026 J jnl
The Telephone k-Multicast Problem.
Algorithmica
Daniel Hathcock, Guy Kortsarz, R. Ravi
2026 J jnl
Vector clock optimization via latency lengths.
Oper. Res. Lett.
Daniel de Roux, Da Qi Chen, R. Ravi
2025 J jnl
Approximately Packing Dijoins via Nowhere-Zero Flows.
Comb.
Gérard Cornuéjols, Siyue Liu, R. Ravi
2025 J jnl
How to Sell High-Dimensional Data Optimally.
CoRR
Andrew Li, R. Ravi, Karan Singh, Zihong Yi, Weizhong Zhang
2025 J jnl
Instance-specific linear relaxations of semidefinite optimization problems.
Math. Program. Comput.
Daniel de Roux, Robert Carr, R. Ravi
2025 A* conf
Minimum Cost Nowhere-Zero Flows and Cut-Balanced Orientations.
ICALP
Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi
2025 J jnl
Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations.
CoRR
Karthekeyan Chandrasekaran, Siyue Liu, R. Ravi
2025 J jnl
Packing Dijoins in Weighted Chordal Digraphs.
CoRR
Gérard Cornuéjols, Siyue Liu, R. Ravi
2025 J jnl
Perfect Fractional Matchings in Bipartite Graphs Via Proportional Allocations.
CoRR
Daniel Hathcock, R. Ravi
2025 A* conf
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs.
SODA
Benjamin Moseley, Aidin Niaparast, R. Ravi
2025 J jnl
The Nonstationary Newsvendor with (and Without) Predictions.
Manuf. Serv. Oper. Manag.
Lin An, Andrew A. Li, Benjamin Moseley, R. Ravi
2025 J jnl
The Steiner Path Aggregation Problem.
CoRR
Da Qi Chen, Daniel Hathcock, D. Ellis Hershkowitz, R. Ravi
2024 B conf
Approximately Packing Dijoins via Nowhere-Zero Flows.
IPCO
Gérard Cornuéjols, Siyue Liu, R. Ravi
2024 A* conf
HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property.
ICDE
Zixuan Chen, Subhodeep Mitra, R. Ravi, Wolfgang Gatterbauer
2024 J jnl
HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property.
CoRR
Zixuan Chen, Subhodeep Mitra, R. Ravi, Wolfgang Gatterbauer
2024 J jnl
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions.
IEEE Trans Autom. Sci. Eng.
Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi
2024 J jnl
Optimal Decision Tree and Adaptive Submodular Ranking with Noisy Outcomes.
J. Mach. Learn. Res.
Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi
2024 J jnl
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs.
CoRR
Benjamin Moseley, Aidin Niaparast, R. Ravi
2024 J jnl
The Telephone
CoRR
Daniel Hathcock, Guy Kortsarz, R. Ravi
2024 A conf
The Telephone k-Multicast Problem.
APPROX/RANDOM
Daniel Hathcock, Guy Kortsarz, R. Ravi
2023 J jnl
A new integer programming formulation of the graphical traveling salesman problem.
Math. Program.
Robert Carr, R. Ravi, Neil Simonetti
2023 A* conf
Approximation Algorithms for Steiner Tree Augmentation Problems.
SODA
R. Ravi, Weizhong Zhang, Michael Zlatin
2023 J jnl
Markdown Pricing Under an Unknown Parametric Demand Model.
CoRR
Su Jia, Andrew A. Li, R. Ravi
2023 J jnl
Optimal Decision Tree with Noisy Outcomes.
CoRR
Su Jia, Fatemeh Navidi, Viswanath Nagarajan, R. Ravi
2023 J jnl
Order Fulfillment Under Pick Failure in Omnichannel Ship-From-Store Programs.
Manuf. Serv. Oper. Manag.
Sagnik Das, R. Ravi, Srinath Sridhar
2023 A* conf
Short-lived High-volume Bandits.
ICML
Su Jia, Nishant Oli, Ian Anderson, Paul Duff, Andrew A. Li, R. Ravi
2023 J jnl
Short-lived High-volume Multi-A(rmed)/B(andits) Testing.
CoRR
Su Jia, Andrew A. Li, R. Ravi, Nishant Oli, Paul Duff, Ian Anderson
2023 A* conf
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models.
SODA
Da Qi Chen, Lin An, Aidin Niaparast, R. Ravi, Oleksandr Rudenko
2023 J jnl
Vertex downgrading to minimize connectivity.
Math. Program.
Hassene Aissi, Da Qi Chen, R. Ravi
2022 B conf
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented?
HCOMP
Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley, R. Ravi
2022 J jnl
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented?
CoRR
Jingyan Wang, Carmel Baharav, Nihar B. Shah, Anita Williams Woolley, R. Ravi
2022 J jnl
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.
Algorithmica
Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie
2022 J jnl
Approximation algorithm for the 2-stage stochastic matroid base problem.
Oper. Res. Lett.
Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang
2022 J jnl
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem.
Oper. Res. Lett.
Jennifer Iglesias, R. Ravi
2022 J jnl
Combinatorial Heuristics for Inventory Routing Problems.
INFORMS J. Comput.
Ziye Tang, Yang Jiao, R. Ravi
2022 A* conf
Dynamic Pricing with Monotonicity Constraint under Unknown Parametric Demand Model.
NeurIPS
Su Jia, Andrew A. Li, R. Ravi
2022 J jnl
Effective Online Order Acceptance Policies for Omnichannel Fulfillment.
Manuf. Serv. Oper. Manag.
Su Jia, Jeremy Karp, R. Ravi, Sridhar R. Tayur
2022 B conf
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract).
SOCS
Nikhil Chandak, Kenny Chour, Sivakumar Rathinam, R. Ravi
2022 J jnl
New and improved approximation algorithms for Steiner Tree Augmentation Problems.
CoRR
R. Ravi, Weizhong Zhang, Michael Zlatin
2022 J jnl
On small-depth tree augmentations.
Oper. Res. Lett.
Ojas Parekh, R. Ravi, Michael Zlatin
2022 J jnl
Two-level hub Steiner trees.
Inf. Process. Lett.
Takuro Fukunaga, R. Ravi, Oleksandr Rudenko, Ziye Tang
2022 J jnl
Unit Perturbations in Budgeted Spanning Tree Problems.
CoRR
Hassene Aissi, Solal Attias, Da Qi Chen, R. Ravi
2021 A conf
A heuristic for statistical seriation.
UAI
Komal Dhull, Jingyan Wang, Nihar B. Shah, Yuanzhi Li, R. Ravi
2021 J jnl
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs.
CoRR
Joseph Cheriyan, R. Ravi, Martin Skutella
2021 J jnl
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs.
Oper. Res. Lett.
Joseph Cheriyan, R. Ravi, Martin Skutella
2021 J jnl
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph.
Inf. Process. Lett.
D. Ellis Hershkowitz, Gregory Kehne, R. Ravi
2021 A conf
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing.
ESA
Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
2021 J jnl
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming.
Oper. Res. Lett.
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
2021 J jnl
On Small-Depth Tree Augmentations.
CoRR
Ojas Parekh, R. Ravi, Michael Zlatin
2021 J jnl
Shorter tours and longer detours: uniform covers and a bit beyond.
Math. Program.
Arash Haddadan, Alantha Newman, R. Ravi
2021 J jnl
The Beneficial Effects of Ad Blockers.
Manag. Sci.
Stylianos Despotakis, R. Ravi, Kannan Srinivasan
2021 J jnl
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models.
CoRR
Da Qi Chen, R. Ravi, Oleksandr Rudenko
2021 — conf
Using Predicted Weights for Ad Delivery.
ACDA
Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
2021 J jnl
Using Predicted Weights for Ad Delivery.
CoRR
Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
2020 J jnl
An Optimal Rounding for Half-Integral Weighted Minimum Strongly Connected Spanning Subgraph.
CoRR
D. Ellis Hershkowitz, Gregory Kehne, R. Ravi
2020 J jnl
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing.
CoRR
Thomas Lavastida, Benjamin Moseley, R. Ravi, Chenyang Xu
2020 — conf
Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem.
SWAT
Sivakumar Rathinam, R. Ravi, J. Bae, Kaarthik Sundar
2020 A conf
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons.
AISTATS
Jingyan Wang, Nihar B. Shah, R. Ravi
2020 J jnl
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures.
Algorithmica
Refael Hassin, R. Ravi, F. Sibel Salman, Danny Segev
2020 — conf
Vertex Downgrading to Minimize Connectivity.
SWAT
Hassene Aissi, Da Qi Chen, R. Ravi
2019 J jnl
A New System-Wide Diversity Measure for Recommendations with Efficient Algorithms.
SIAM J. Math. Data Sci.
Arda Antikacioglu, Tanvi Bajpai, R. Ravi
2019 J jnl
Algorithms for automatic ranking of participants and tasks in an anonymized contest.
Theor. Comput. Sci.
Yang Jiao, R. Ravi, Wolfgang Gatterbauer
2019 J jnl
Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces.
SIAM J. Discret. Math.
Anastasios Sidiropoulos, Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Piotr Indyk, Yuri Rabinovich, Harald Räcke, R. Ravi
2019 J jnl
Downgrading to Minimize Connectivity.
CoRR
Hassene Aissi, Da Qi Chen, R. Ravi
2019 B conf
Inventory Routing Problem with Facility Location.
WADS
Yang Jiao, R. Ravi
2019 J jnl
Inventory Routing Problem with Facility Location.
CoRR
Yang Jiao, R. Ravi
2019 A conf
Multicommodity Multicast, Wireless and Fast.
ESA
R. Ravi, Oleksandr Rudenko
2019 A* conf
Optimal Decision Tree with Noisy Outcomes.
NeurIPS
Su Jia, Viswanath Nagarajan, Fatemeh Navidi, R. Ravi
2019 — conf
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty.
APPROX-RANDOM
David Ellis Hershkowitz, R. Ravi, Sahil Singla
2019 J jnl
Stretching the Effectiveness of MLE from Accuracy to Bias for Pairwise Comparisons.
CoRR
Jingyan Wang, Nihar B. Shah, R. Ravi
2018 J jnl
A new system-wide diversity measure for recommendations with efficient algorithms.
CoRR
Arda Antikacioglu, Tanvi Bajpai, R. Ravi
2018 B conf
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.
LATIN
Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie
2018 B conf
Plane Gossip: Approximating Rumor Spread in Planar Graphs.
LATIN
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram
2018 J jnl
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty.
CoRR
D. Ellis Hershkowitz, R. Ravi, Sahil Singla
2017 B conf
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest.
WALCOM
Yang Jiao, R. Ravi, Wolfgang Gatterbauer
2017 J jnl
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems.
Math. Oper. Res.
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2017 J jnl
Approximation Algorithms for Replenishment Problems with Fixed Turnover Times.
CoRR
Thomas Bosman, Martijn van Ee, Yang Jiao, Alberto Marchetti-Spaccamela, R. Ravi, Leen Stougie
2017 J jnl
Coloring Down: $3/2$-approximation for special cases of the weighted tree augmentation problem.
CoRR
Jennifer Iglesias, R. Ravi
2017 J jnl
Cover and Conquer: Augmenting Decompositions for Connectivity Problems.
CoRR
Arash Haddadan, Alantha Newman, R. Ravi
2017 J jnl
Expertise in Online Markets.
Manag. Sci.
Stylianos Despotakis, Isa Emin Hafalir, R. Ravi, Amin Sayedi
2017 A* conf
LAST but not Least: Online Spanners for Buy-at-Bulk.
SODA
Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
2017 J jnl
Multiple facility location on a network with linear reliability order of edges.
J. Comb. Optim.
Refael Hassin, R. Ravi, F. Sibel Salman
2017 J jnl
Network Flow Based Post Processing for Sales Diversity.
CoRR
Arda Antikacioglu, R. Ravi
2017 — conf
On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
APPROX-RANDOM
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017 J jnl
On the Integrality Gap of the Prize-Collecting Steiner Forest LP.
CoRR
Jochen Könemann, Neil Olver, Kanstantsin Pashkovich, R. Ravi, Chaitanya Swamy, Jens Vygen
2017 A* conf
Post Processing Recommender Systems for Diversity.
KDD
Arda Antikacioglu, R. Ravi
2017 A conf
Randomized Contractions for Multiobjective Minimum Cuts.
ESA
Hassene Aissi, Ali Ridha Mahjoub, R. Ravi
2017 A conf
Single-Sink Fractionally Subadditive Network Design.
ESA
Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità
2017 J jnl
Single-sink Fractionally Subadditive Network Design.
CoRR
Guru Guruganesh, Jennifer Iglesias, R. Ravi, Laura Sanità
2016 J jnl
A -approximation algorithm for Graphic TSP in cubic bipartite graphs.
Discret. Appl. Math.
Jeremy Karp, R. Ravi
2016 J jnl
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest.
CoRR
Yang Jiao, R. Ravi, Wolfgang Gatterbauer
2016 Misc conf
Balls and Funnels: Energy Efficient Group-to-Group Anycasts.
COCOON
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram
2016 J jnl
Balls and Funnels: Energy Efficient Group-to-Group Anycasts.
CoRR
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram
2016 J jnl
Capacitated Vehicle Routing with Nonuniform Speeds.
Math. Oper. Res.
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
2016 J jnl
Current Trends in Combinatorial Optimization (NII Shonan Meeting 2016-7).
NII Shonan Meet. Rep.
Takuro Fukunaga, R. Ravi, László A. Végh
2016 J jnl
Hardware Implementation of Architecture Techniques for Fast Efficient Lossless Image Compression System.
Wirel. Pers. Commun.
N. Muthukumaran, R. Ravi
2016 J jnl
LAST but not Least: Online Spanners for Buy-at-Bulk.
CoRR
Anupam Gupta, R. Ravi, Kunal Talwar, Seeun William Umboh
2016 J jnl
Plane Gossip: Approximating rumor spread in planar graphs.
CoRR
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram
2016 J jnl
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets.
ACM Trans. Algorithms
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2015 — conf
Designing Overlapping Networks for Publish-Subscribe Systems.
APPROX-RANDOM
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram
2015 J jnl
Efficient cost-sharing mechanisms for prize-collecting problems.
Math. Program.
Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
2015 J jnl
Improved approximations for two-stage min-cut and shortest path problems under uncertainty.
Math. Program.
Daniel Golovin, Vineet Goyal, Valentin Polishchuk, R. Ravi, Mikko Sysikaski
2015 J jnl
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
SIAM J. Comput.
Takuro Fukunaga, Zeev Nutov, R. Ravi
2015 J jnl
Minimum Makespan Multi-Vehicle Dial-a-Ride.
ACM Trans. Algorithms
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
2015 A* conf
Recommendation Subgraphs for Web Discovery.
WWW
Arda Antikacioglu, R. Ravi, Srinath Sridhar
2015 — conf
Rumors Across Radio, Wireless, Telephone.
FSTTCS
Jennifer Iglesias, Rajmohan Rajaraman, R. Ravi, Ravi Sundaram
2015 J jnl
Running Errands in Time: Approximation Algorithms for Stochastic Orienteering.
Math. Oper. Res.
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
2015 J jnl
The Performances Analysis of Fast Efficient Lossless Satellite Image Compression and Decompression for Wavelet Based Algorithm.
Wirel. Pers. Commun.
N. Muthukumaran, R. Ravi
2014 — conf
A 9/7 -Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs.
APPROX-RANDOM
Jeremy Karp, R. Ravi
2014 — ed.
Algorithm Theory - SWAT 2014 - 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings
SWAT
R. Ravi, Inge Li Gørtz
2014 — conf
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem.
APPROX-RANDOM
Takuro Fukunaga, Afshin Nikzad, R. Ravi
2014 B conf
Graph-TSP from Steiner Cycles.
WG
Satoru Iwata, Alantha Newman, R. Ravi
2014 J jnl
Graph-TSP from Steiner Cycles.
CoRR
Satoru Iwata, Alantha Newman, R. Ravi
2014 J jnl
New approaches to multi-objective optimization.
Math. Program.
Fabrizio Grandoni, R. Ravi, Mohit Singh, Rico Zenklusen
2014 J jnl
Recommendation Subgraphs for Web Discovery.
CoRR
Arda Antikacioglu, R. Ravi, Srinath Sridhar
2014 — conf
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems.
ICALP (2)
Afshin Nikzad, R. Ravi
2014 B conf
Short Tours through Large Linear Forests.
IPCO
Uriel Feige, R. Ravi, Mohit Singh
2014 J jnl
The Geometry of Online Packing Linear Programs.
Math. Oper. Res.
Marco Molinaro, R. Ravi
2014 J jnl
Thresholded covering algorithms for robust and max-min optimization.
Math. Program.
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2013 J jnl
A 9/7-Approximation Algorithm for Graphic TSP in Cubic Bipartite Graphs.
CoRR
Jeremy Karp, R. Ravi
2013 J jnl
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set.
Oper. Res. Lett.
Vineet Goyal, R. Ravi
2013 J jnl
Approximating max-min weighted T-joins.
Oper. Res. Lett.
Satoru Iwata, R. Ravi
2013 — conf
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Fundamental Problems in Computing
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
2013 J jnl
Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz
2012 J jnl
A near Pareto optimal auction with budget constraints.
Games Econ. Behav.
Isa Emin Hafalir, R. Ravi, Amin Sayedi
2012 J jnl
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
CoRR
Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
2012 — conf
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.
ICALP (1)
Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
2012 J jnl
Approximation algorithms for distance constrained vehicle routing problems.
Networks
Viswanath Nagarajan, R. Ravi
2012 A* conf
Approximation algorithms for stochastic orienteering.
SODA
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
2012 — conf
Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data.
BCB
Ming-Chi Tsai, Guy E. Blelloch, Russell Schwartz, R. Ravi
2012 J jnl
Geometry of Online Packing Linear Programs
CoRR
Marco Molinaro, R. Ravi
2012 — conf
Geometry of Online Packing Linear Programs.
ICALP (1)
Marco Molinaro, R. Ravi
2012 A conf
Iterative Methods in Combinatorial Optimization (Invited Talk).
STACS
R. Ravi
2012 A* conf
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
FOCS
Takuro Fukunaga, R. Ravi
2012 J jnl
Iterative rounding approximation algorithms for degree-bounded node-connectivity network design
CoRR
Takuro Fukunaga, R. Ravi
2012 J jnl
Online and Stochastic Survivable Network Design.
SIAM J. Comput.
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2012 J jnl
Technical Note - Approximation Algorithms for VRP with Stochastic Demands.
Oper. Res.
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2011 J jnl
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure.
IEEE ACM Trans. Comput. Biol. Bioinform.
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz
2011 J jnl
An FPTAS for minimizing the product of two non-negative linear cost functions.
Math. Program.
Vineet Goyal, Latife Genç Kaya, R. Ravi
2011 B conf
An Optimization-Based Sampling Scheme for Phylogenetic Trees.
RECOMB
Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
2011 J jnl
An Optimization-Based Sampling Scheme for Phylogenetic Trees.
J. Comput. Biol.
Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
2011 J jnl
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
CoRR
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
2011 A* conf
Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits.
FOCS
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro, R. Ravi
2011 — ed.
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
APPROX-RANDOM
Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim
2011 B conf
Capacitated Vehicle Routing with Non-uniform Speeds.
IPCO
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
2011 J jnl
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny.
J. Comput. Biol.
Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
2011 J jnl
Minimum Makespan Multi-vehicle Dial-a-Ride
CoRR
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
2011 J jnl
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems.
SIAM J. Comput.
Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
2011 J jnl
Special Section on Foundations of Computer Science.
SIAM J. Comput.
Scott Aaronson, Jeff Erickson, Mohammad Mahdian, R. Ravi, Emanuele Viola
2011 J jnl
The Directed Orienteering Problem.
Algorithmica
Viswanath Nagarajan, R. Ravi
2011 J jnl
The Query-commit Problem
CoRR
Marco Molinaro, R. Ravi
2011 A* conf
We know who you followed last summer: inferring social link creation times in twitter.
WWW
Brendan Meeder, Brian Karrer, Amin Sayedi, R. Ravi, Christian Borgs, Jennifer T. Chayes
2010 — conf
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure.
ISBRA
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz
2010 J jnl
A PTAS for the chance-constrained knapsack problem with random item sizes.
Oper. Res. Lett.
Vineet Goyal, R. Ravi
2010 J jnl
An improved approximation algorithm for requirement cut.
Oper. Res. Lett.
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010 J jnl
Approximation Algorithms for Multicommodity Facility Location Problems.
SIAM J. Discret. Math.
R. Ravi, Amitabh Sinha
2010 J jnl
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
CoRR
Anupam Gupta, Ravishankar Krishnaswamy, Viswanath Nagarajan, R. Ravi
2010 — conf
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems.
ICALP (1)
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010 J jnl
Approximation Algorithms for Requirement Cut on Graphs.
Algorithmica
Viswanath Nagarajan, R. Ravi
2010 J jnl
Capacitated Vehicle Routing with Non-Uniform Speeds
CoRR
Inge Li Gørtz, Marco Molinaro, Viswanath Nagarajan, R. Ravi
2010 J jnl
Dial a Ride from
ACM Trans. Algorithms
Anupam Gupta, Mohammad Taghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2010 C conf
Game-Theoretic Models of Information Overload in Social Networks.
WAW
Christian Borgs, Jennifer T. Chayes, Brian Karrer, Brendan Meeder, R. Ravi, Ray E. Reagans, Amin Sayedi
2010 B conf
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny.
RECOMB
Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz
2010 J jnl
Integrated optimization of customer and supplier logistics at Robert Bosch LLC.
Eur. J. Oper. Res.
Hakan Yildiz, R. Ravi, Wayne Fairey
2010 J jnl
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
CoRR
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010 J jnl
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems.
Oper. Res. Lett.
Viswanath Nagarajan, R. Ravi, Mohit Singh
2010 — conf
Thresholded Covering Algorithms for Robust and Max-min Optimization.
ICALP (1)
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2010 A* conf
Tree Embeddings for Two-Edge-Connected Network Design.
SODA
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2009 — conf
Iterative Methods in Combinatorial Optimization.
FSTTCS
R. Ravi
2009 A conf
Iterative Rounding for Multi-Objective Optimization Problems.
ESA
Fabrizio Grandoni, R. Ravi, Mohit Singh
2009 J jnl
Line-of-Sight Networks.
Comb. Probab. Comput.
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany
2009 A conf
Minimum Makespan Multi-vehicle Dial-a-Ride.
ESA
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
2009 A* conf
Online and stochastic survivable network design.
STOC
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
2009 J jnl
Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders
CoRR
Isa Emin Hafalir, R. Ravi, Amin Sayedi
2009 J jnl
Thresholded Covering Algorithms for Robust and Max-Min Optimization
CoRR
Anupam Gupta, Viswanath Nagarajan, R. Ravi
2009 A conf
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links.
ESA
Refael Hassin, R. Ravi, F. Sibel Salman
2008 J jnl
Approximating k.
Eur. J. Oper. Res.
R. Ravi, Amitabh Sinha
2008 J jnl
Haplotyping for Disease Association: A Combinatorial Approach.
IEEE ACM Trans. Comput. Biol. Bioinform.
Giuseppe Lancia, R. Ravi, Romeo Rizzi
2008 J jnl
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference.
IEEE ACM Trans. Comput. Biol. Bioinform.
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz
2008 J jnl
Solving the Capacitated Local Access Network Design Problem.
INFORMS J. Comput.
F. Sibel Salman, R. Ravi, John N. Hooker
2008 — conf
The Directed Minimum Latency Problem.
APPROX-RANDOM
Viswanath Nagarajan, R. Ravi
2007 J jnl
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.
IEEE ACM Trans. Comput. Biol. Bioinform.
Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz
2007 A* conf
An efficient cost-sharing mechanism for the prize-collecting Steiner forest problem.
SODA
Anupam Gupta, Jochen Könemann, Stefano Leonardi, R. Ravi, Guido Schäfer
2007 A conf
Dial a Ride from
ESA
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2007 J jnl
Dial a Ride from k-forest
CoRR
Anupam Gupta, MohammadTaghi Hajiaghayi, Viswanath Nagarajan, R. Ravi
2007 J jnl
Direct maximum parsimony phylogeny reconstruction from genotype data.
BMC Bioinform.
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz
2007 — conf
Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming.
ISBRA
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz
2007 J jnl
LP Rounding Approximation Algorithms for Stochastic Network Design.
Math. Oper. Res.
Anupam Gupta, R. Ravi, Amitabh Sinha
2007 A* conf
Line-of-sight networks.
SODA
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren Debany
2007 — conf
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems.
APPROX-RANDOM
Viswanath Nagarajan, R. Ravi
2007 A conf
Pricing Tree Access Networks with Connected Backbones.
ESA
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. Ravi
2006 J jnl
Approximation Algorithms for Minimizing Average Distortion.
Theory Comput. Syst.
Kedar Dhamdhere, Anupam Gupta, R. Ravi
2006 J jnl
Approximation Algorithms for Problems Combining Facility Location and Network Design.
Oper. Res.
R. Ravi, Amitabh Sinha
2006 — conf
Bayesian Optimal No-Deficit Mechanism Design.
WINE
Shuchi Chawla, Jason D. Hartline, Uday Rajan, R. Ravi
2006 — conf
Delegate and Conquer: An LP-Based Approximation Algorithm for Minimum Degree MSTs.
ICALP (1)
R. Ravi, Mohit Singh
2006 — conf
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.
ICALP (1)
Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar
2006 J jnl
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
Math. Program.
R. Ravi, Amitabh Sinha
2006 B conf
Matching Based Augmentations for Approximating Connectivity Problems.
LATIN
R. Ravi
2006 J jnl
Min-Max payoffs in a two-player location game.
Oper. Res. Lett.
Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha
2006 — conf
Minimum Vehicle Routing with a Common Deadline.
APPROX-RANDOM
Viswanath Nagarajan, R. Ravi
2006 A conf
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
STACS
Daniel Golovin, Vineet Goyal, R. Ravi
2006 Misc conf
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.
International Conference on Computational Science (2)
Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz
2005 — conf
Approximation Algorithms for Requirement Cut on Graphs.
APPROX-RANDOM
Viswanath Nagarajan, R. Ravi
2005 A* conf
Approximation algorithms for low-distortion embeddings into low-dimensional spaces.
SODA
Mihai Badoiu, Kedar Dhamdhere, Anupam Gupta, Yuri Rabinovich, Harald Räcke, R. Ravi, Anastasios Sidiropoulos
2005 B conf
Finding effective support-tree preconditioners.
SPAA
Bruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo
2005 A* conf
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.
FOCS
Kedar Dhamdhere, Vineet Goyal, R. Ravi, Mohit Singh
2005 B conf
On Two-Stage Stochastic Minimum Spanning Trees.
IPCO
Kedar Dhamdhere, R. Ravi, Mohit Singh
2005 J jnl
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds.
SIAM J. Comput.
Jochen Könemann, R. Ravi
2005 — conf
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.
APPROX-RANDOM
Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
2004 J jnl
A linear-time algorithm to compute a MAD tree of an interval graph.
Inf. Process. Lett.
Elias Dahlhaus, Peter Dankelmann, R. Ravi
2004 A* conf
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.
FOCS
Anupam Gupta, R. Ravi, Amitabh Sinha
2004 A conf
Approximation Algorithms for Minimizing Average Distortion.
STACS
Kedar Dhamdhere, Anupam Gupta, R. Ravi
2004 J jnl
Approximation Algorithms for a Capacitated Network Design Problem.
Algorithmica
Refael Hassin, R. Ravi, F. Sibel Salman
2004 J jnl
Approximation algorithms for finding low-degree subgraphs.
Networks
Philip N. Klein, Radha Krishnan, Balaji Raghavachari, R. Ravi
2004 A* conf
Boosted sampling: approximation algorithms for stochastic optimization.
STOC
Anupam Gupta, Martin Pál, R. Ravi, Amitabh Sinha
2004 B conf
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems.
IPCO
R. Ravi, Amitabh Sinha
2004 J jnl
Min-max tree covers of graphs.
Oper. Res. Lett.
Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
2004 A* conf
Multicommodity facility location.
SODA
R. Ravi, Amitabh Sinha
2004 — conf
On the Crossing Spanning Tree Problem.
APPROX-RANDOM
Vittorio Bilò, Vineet Goyal, R. Ravi, Mohit Singh
2004 A* conf
Worst-case payoffs of a location game.
EC
Shuchi Chawla, Uday Rajan, R. Ravi, Amitabh Sinha
2003 J jnl
Approximation algorithms for the test cover problem.
Math. Program.
Koen M. J. De Bontridder, Bjarni V. Halldórsson, Magnús M. Halldórsson, Cor A. J. Hurkens, Jan Karel Lenstra, R. Ravi, Leen Stougie
2003 — conf
Covering Graphs Using Trees and Stars.
RANDOM-APPROX
Guy Even, Naveen Garg, Jochen Könemann, R. Ravi, Amitabh Sinha
2003 A* conf
Primal-dual meets local search: approximating MST's with nonuniform degree bounds.
STOC
Jochen Könemann, R. Ravi
2003 A* conf
Profit guaranteeing mechanisms for multicast networks.
EC
Shuchi Chawla, D. Kitchin, Uday Rajan, R. Ravi, Amitabh Sinha
2003 — conf
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.
FSTTCS
Jochen Könemann, R. Ravi
2003 J jnl
Reconstructing edge-disjoint paths.
Oper. Res. Lett.
Michele Conforti, Refael Hassin, R. Ravi
2002 J jnl
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees.
SIAM J. Comput.
Jochen Könemann, R. Ravi
2002 A* conf
Approximating k-cuts via network strength.
SODA
R. Ravi, Amitabh Sinha II
2002 J jnl
Approximation algorithms for the covering Steiner problem.
Random Struct. Algorithms
Goran Konjevod, R. Ravi, Aravind Srinivasan
2002 — conf
Bicriteria Spanning Tree Problems.
APPROX
R. Ravi
2002 J jnl
Erratum: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
Algorithmica
R. Ravi, David P. Williamson
2002 A* conf
Erratum: an approximation algorithm for minimum-cost vertex-connectivity problems.
SODA
R. Ravi, David P. Williamson
2002 A conf
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
ESA
Eduardo Sany Laber, Ojas Parekh, R. Ravi
2001 J jnl
Approximating the Single-Sink Link-Installation Problem in Network Design.
SIAM J. Optim.
F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian
2001 J jnl
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Algorithmica
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
2001 J jnl
On approximating planar metrics by tree metrics.
Inf. Process. Lett.
Goran Konjevod, R. Ravi, F. Sibel Salman
2001 A conf
On the Approximability of the Minimum Test Collection Problem.
ESA
Bjarni V. Halldórsson, Magnús M. Halldórsson, R. Ravi
2001 B conf
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
IPCO
Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F. Sibel Salman, Amitabh Sinha II
2001 J jnl
Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues.
Manag. Sci.
Pinar Keskinocak, R. Ravi, Sridhar R. Tayur
2000 J jnl
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
J. Algorithms
Naveen Garg, Goran Konjevod, R. Ravi
2000 A* conf
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees.
STOC
Jochen Könemann, R. Ravi
2000 A* conf
An approximation algorithm for the covering Steiner problem.
SODA
Goran Konjevod, R. Ravi
2000 J jnl
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim.
Milind Dawande, Jayant Kalagnanam, Pinar Keskinocak, F. Sibel Salman, R. Ravi
2000 — conf
Approximation algorithms for a capacitated network design problem.
APPROX
Refael Hassin, R. Ravi, F. Sibel Salman
2000 J jnl
Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems.
Theor. Comput. Sci.
Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala
1999 J jnl
A Constant-Factor Approximation Algorithm for the
J. Comput. Syst. Sci.
Avrim Blum, R. Ravi, Santosh S. Vempala
1999 J jnl
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SIAM J. Comput.
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
1999 A conf
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
ESA
R. Ravi, F. Sibel Salman
1999 B conf
GESTALT: Genomic Steiner Alignments.
CPM
Giuseppe Lancia, R. Ravi
1999 J jnl
Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1999 J jnl
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci.
Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1999 A conf
On 2-Coverings and 2-Packings of Laminar Families.
ESA
Joseph Cheriyan, Tibor Jordán, R. Ravi
1999 — conf
Redeeming Nested Dissection: Parallelism Implies Fill.
PP
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
1998 B conf
A New Bound for the 2-Edge Connected Subgraph Problem.
IPCO
Robert Carr, R. Ravi
1998 A* conf
A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem.
SODA
Naveen Garg, Goran Konjevod, R. Ravi
1998 A* conf
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees.
SODA
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang
1998 J jnl
Approximating Maximum Leaf Spanning Trees in Almost Linear Time.
J. Algorithms
Hsueh-I Lu, R. Ravi
1998 J jnl
Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim.
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
1998 J jnl
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
Discret. Appl. Math.
R. Ravi, John D. Kececioglu
1998 J jnl
Bicriteria Network Design Problems
CoRR
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1998 J jnl
Bicriteria Network Design Problems.
J. Algorithms
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1998 J jnl
Optimal Circuits for Parallel Multipliers.
IEEE Trans. Computers
Paul F. Stelling, Charles U. Martel, Vojin G. Oklobdzija, R. Ravi
1998 A* conf
Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems.
STOC
Avrim Blum, Goran Konjevod, R. Ravi, Santosh S. Vempala
1998 J jnl
The
Inf. Process. Lett.
Shiva Chaudhuri, Naveen Garg, R. Ravi
1997 — conf
A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.
ISPAN
Hsueh-I Lu, R. Ravi
1997 J jnl
An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
Algorithmica
R. Ravi, David P. Williamson
1997 B conf
Banishing Bias from Consensus Sequences.
CPM
Amir Ben-Dor, Giuseppe Lancia, Jennifer Perone, R. Ravi
1997 A* conf
Buy-at-Bulk Network Design: Approximating the Single-Sink Edge Installation Problem.
SODA
F. Sibel Salman, Joseph Cheriyan, R. Ravi, S. Subramanian
1997 — conf
Improved results on service-constrained network design problems.
Network Design: Connectivity and Facilities Location
Madhav V. Marathe, R. Ravi, Ravi Sundaram
1997 A* conf
Improving Spanning Trees by Upgrading Nodes.
ICALP
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth
1997 — conf
Network improvement problems.
Network Design: Connectivity and Facilities Location
Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi
1997 A* conf
Parallelizing Elimination Orders with Linear Fill.
FOCS
Claudson F. Bornstein, Bruce M. Maggs, Gary L. Miller, R. Ravi
1996 A* conf
A Constant-factor Approximation Algorithm for the
STOC
Avrim Blum, R. Ravi, Santosh S. Vempala
1996 J jnl
Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles).
Discret. Appl. Math.
Vineet Bafna, Babu O. Narayanan, R. Ravi
1996 — conf
Service-Constrained Network Design Problems.
SWAT
Madhav V. Marathe, R. Ravi, Ravi Sundaram
1996 J jnl
Service-Constrained Network Design Problems.
Nord. J. Comput.
Madhav V. Marathe, R. Ravi, Ravi Sundaram
1996 J jnl
Spanning Trees - Short or Small.
SIAM J. Discret. Math.
R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
1996 — conf
The Constrained Minimum Spanning Tree Problem (Extended Abstract).
SWAT
R. Ravi, Michel X. Goemans
1995 J jnl
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees.
J. Algorithms
Philip N. Klein, R. Ravi
1995 J jnl
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.
Comb.
Philip N. Klein, Satish Rao, Ajit Agrawal, R. Ravi
1995 B conf
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
CPM
R. Ravi, John D. Kececioglu
1995 A* conf
Bicriteria Network Design Problems.
ICALP
Madhav V. Marathe, R. Ravi, Ravi Sundaram, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1995 B conf
Computing Similarity between RNA Strings.
CPM
Vineet Bafna, S. Muthukrishnan, R. Ravi
1995 A* conf
David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
SODA
R. Ravi
1995 C conf
Design Strategies for Optimal Multiplier Circuits.
IEEE Symposium on Computer Arithmetic
Charles U. Martel, Vojin G. Oklobdzija, R. Ravi, Paul F. Stelling
1995 B conf
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles).
WADS
Vineet Bafna, Babu O. Narayanan, R. Ravi
1995 A* conf
Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation.
SODA
John D. Kececioglu, R. Ravi
1995 J jnl
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks.
SIAM J. Comput.
Ajit Agrawal, Philip N. Klein, R. Ravi
1994 J jnl
A Primal-Dual Approximation Algorithm for the Steiner Forest Problem.
Inf. Process. Lett.
R. Ravi
1994 A* conf
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract)
FOCS
R. Ravi
1994 A* conf
Spanning Trees Short or Small.
SODA
R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, S. S. Ravi
1993 B conf
A nearly best-possible approximation algorithm for node-weighted Steiner trees.
IPCO
Philip N. Klein, R. Ravi
1993 A* conf
Many birds with one stone: multi-objective approximation algorithms.
STOC
R. Ravi, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Harry B. Hunt III
1993 B conf
When cycles collapse: A general approximation technique for constrained two-connectivity problems.
IPCO
Philip N. Klein, R. Ravi
1992 J jnl
An optimal algorithm to solve the all-pair shortest path problem on interval graphs.
Networks
R. Ravi, Madhav V. Marathe, C. Pandu Rangan
1992 — conf
Approximation Through Local Optimality: Designing Networks with Small Degree.
FSTTCS
R. Ravi, Balaji Raghavachari, Philip N. Klein
1992 J jnl
Generalized Vertex Covering in Interval Graphs.
Discret. Appl. Math.
Madhav V. Marathe, R. Ravi, C. Pandu Rangan
1991 A* conf
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion.
ICALP
R. Ravi, Ajit Agrawal, Philip N. Klein
1991 A* conf
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
STOC
Ajit Agrawal, Philip N. Klein, R. Ravi
1990 A* conf
Approximation through Multicommodity Flow
FOCS
Philip N. Klein, Ajit Agrawal, R. Ravi, Satish Rao