R. Ravi
Orcid: 0000-0001-7603-1207Affiliations:
- Carnegie Mellon University, Pittsburgh, PA, USA
According to our database1,
R. Ravi
authored at least 222 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions.
IEEE Trans Autom. Sci. Eng., October, 2024
Putting Off the Catching Up: Online Joint Replenishment Problem with Holding and Backlog Costs.
CoRR, 2024
Proceedings of the Integer Programming and Combinatorial Optimization, 2024
HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property.
Proceedings of the 40th IEEE International Conference on Data Engineering, 2024
2023
Manuf. Serv. Oper. Manag., March, 2023
Math. Program., February, 2023
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023
Proceedings of the International Conference on Machine Learning, 2023
2022
Coloring down: 3/2-approximation for special cases of the weighted tree augmentation problem.
Oper. Res. Lett., 2022
Oper. Res. Lett., 2022
Manuf. Serv. Oper. Manag., 2022
CoRR, 2022
Algorithmica, 2022
Informed Steiner Trees: Sampling and Pruning for Multi-Goal Path Finding in High Dimensions (Extended Abstract).
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Allocation Schemes in Analytic Evaluation: Applicant-Centric Holistic or Attribute-Centric Segmented?
Proceedings of the Tenth AAAI Conference on Human Computation and Crowdsourcing, 2022
2021
A simple proof of the Moore-Hodgson Algorithm for minimizing the number of late jobs.
Oper. Res. Lett., 2021
Local improvement algorithms for a path packing problem: A performance analysis based on linear programming.
Oper. Res. Lett., 2021
Math. Program., 2021
An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph.
Inf. Process. Lett., 2021
Timeliness Through Telephones: Approximating Information Freshness in Vector Clock Models.
CoRR, 2021
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021
Learnable and Instance-Robust Predictions for Online Matching, Flows and Load Balancing.
Proceedings of the 29th Annual European Symposium on Algorithms, 2021
Proceedings of the 2021 SIAM Conference on Applied and Computational Discrete Algorithms, 2021
2020
The Approximability of Multiple Facility Location on Directed Networks with Random Arc Failures.
Algorithmica, 2020
Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem.
Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020
Proceedings of the 23rd International Conference on Artificial Intelligence and Statistics, 2020
2019
Theor. Comput. Sci., 2019
SIAM J. Math. Data Sci., 2019
SIAM J. Discret. Math., 2019
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019
Proceedings of the 27th Annual European Symposium on Algorithms, 2019
Prepare for the Expected Worst: Algorithms for Reconfigurable Resources Under Uncertainty.
Proceedings of the Approximation, 2019
2018
Proceedings of the LATIN 2018: Theoretical Informatics, 2018
2017
Math. Oper. Res., 2017
J. Comb. Optim., 2017
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Proceedings of the 25th Annual European Symposium on Algorithms, 2017
Proceedings of the Approximation, 2017
2016
Hardware Implementation of Architecture Techniques for Fast Efficient Lossless Image Compression System.
Wirel. Pers. Commun., 2016
ACM Trans. Algorithms, 2016
NII Shonan Meet. Rep., 2016
Discret. Appl. Math., 2016
Proceedings of the Computing and Combinatorics - 22nd International Conference, 2016
2015
The Performances Analysis of Fast Efficient Lossless Satellite Image Compression and Decompression for Wavelet Based Algorithm.
Wirel. Pers. Commun., 2015
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
SIAM J. Comput., 2015
Math. Program., 2015
Improved approximations for two-stage min-cut and shortest path problems under uncertainty.
Math. Program., 2015
Math. Oper. Res., 2015
Proceedings of the 24th International Conference on World Wide Web, 2015
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015
Proceedings of the Approximation, 2015
2014
Math. Program., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Proceedings of the Integer Programming and Combinatorial Optimization, 2014
Sending Secrets Swiftly: Approximation Algorithms for Generalized Multicast Problems.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014
Proceedings of the Approximation, 2014
Deliver or hold: Approximation Algorithms for the Periodic Inventory Routing Problem.
Proceedings of the Approximation, 2014
2013
Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set.
Oper. Res. Lett., 2013
2012
Networks, 2012
Oper. Res., 2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012
Iterative Rounding Approximation Algorithms for Degree-Bounded Node-Connectivity Network Design.
Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012
2011
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems.
SIAM J. Comput., 2011
Math. Program., 2011
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny.
J. Comput. Biol., 2011
We know who you followed last summer: inferring social link creation times in twitter.
Proceedings of the 20th International Conference on World Wide Web, 2011
Proceedings of the Integer Programming and Combinatoral Optimization, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
2010
SIAM J. Discret. Math., 2010
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems.
Oper. Res. Lett., 2010
Oper. Res. Lett., 2010
Eur. J. Oper. Res., 2010
CoRR, 2010
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010
2009
Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders
CoRR, 2009
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2009
Tractable Cases of Facility Location on a Network with a Linear Reliability Order of Links.
Proceedings of the Algorithms, 2009
Proceedings of the Algorithms, 2009
2008
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
INFORMS J. Comput., 2008
2007
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007
Math. Oper. Res., 2007
BMC Bioinform., 2007
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007
Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007
Proceedings of the Algorithms, 2007
Proceedings of the Approximation, 2007
2006
Theory Comput. Syst., 2006
Math. Program., 2006
Approximation Algorithms for Problems Combining Facility Location and Network Design.
Oper. Res., 2006
Proceedings of the Internet and Network Economics, Second International Workshop, 2006
Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems.
Proceedings of the STACS 2006, 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Proceedings of the Computational Science, 2006
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006
Proceedings of the Approximation, 2006
2005
SIAM J. Comput., 2005
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005
Proceedings of the Integer Programming and Combinatorial Optimization, 2005
How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems.
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
What About Wednesday? Approximation Algorithms for Multistage Stochastic Optimization.
Proceedings of the Approximation, 2005
2004
Inf. Process. Lett., 2004
Algorithmica, 2004
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Proceedings 5th ACM Conference on Electronic Commerce (EC-2004), 2004
An Edge in Time Saves Nine: LP Rounding Approximation Algorithms for Stochastic Network Design.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004
2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the Proceedings 4th ACM Conference on Electronic Commerce (EC-2003), 2003
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003
2002
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees.
SIAM J. Comput., 2002
Random Struct. Algorithms, 2002
Algorithmica, 2002
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002
Randomized Approximation Algorithms for Query Optimization Problems on Two Processors.
Proceedings of the Algorithms, 2002
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002
2001
SIAM J. Optim., 2001
Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues.
Manag. Sci., 2001
Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design Problems.
Algorithmica, 2001
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2001
Proceedings of the Algorithms, 2001
2000
Theor. Comput. Sci., 2000
Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.
J. Comb. Optim., 2000
J. Algorithms, 2000
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000
1999
SIAM J. Comput., 1999
J. Comput. Syst. Sci., 1999
Redeeming Nested Dissection: Parallelism Implies Fill.
Proceedings of the Ninth SIAM Conference on Parallel Processing for Scientific Computing, 1999
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design.
Proceedings of the Algorithms, 1999
Proceedings of the Algorithms, 1999
Proceedings of the Combinatorial Pattern Matching, 10th Annual Symposium, 1999
1998
J. Comb. Optim., 1998
Approximation Algorithms for Multiple Sequence Alignment Under a Fixed Evolutionary Tree.
Discret. Appl. Math., 1998
Proceedings of the Integer Programming and Combinatorial Optimization, 1998
1997
Algorithmica, 1997
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997
Proceedings of the 1997 International Symposium on Parallel Architectures, 1997
Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997
Proceedings of the Network Design: Connectivity and Facilities Location, 1997
Proceedings of the Network Design: Connectivity and Facilities Location, 1997
Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997
1996
Service-Constrained Network Design Problems.
Nord. J. Comput., 1996
Nonoverlapping Local Alignments (weighted Independent Sets of Axis-parallel Rectangles).
Discret. Appl. Math., 1996
Proceedings of the Algorithm Theory, 1996
A Constant-factor Approximation Algorithm for the <i>k</i> MST Problem (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
1995
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks.
SIAM J. Comput., 1995
J. Algorithms, 1995
An Approximate Max-Flow Min-Cut Relation for Unidirected Multicommodity Flow, with Applications.
Comb., 1995
Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles).
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995
David P. Williamson: An Approximation Algorithm for Minimum-Cost Vertex-Connectivity Problems.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995
Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995
Proceedings of the 12th Symposium on Computer Arithmetic (ARITH-12 '95), 1995
1994
Inf. Process. Lett., 1994
Rapid Rumor Ramification: Approximating the minimum broadcast time (Extended Abstract)
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1993
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
When cycles collapse: A general approximation technique for constrained two-connectivity problems.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993
1992
Networks, 1992
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992
1991
Ordering Problems Approximated: Single-Processor Scheduling and Interval Graph Completion.
Proceedings of the Automata, Languages and Programming, 18th International Colloquium, 1991
1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990