- A Lineartime Algorithm to Compute a MAD Tree of an Interval Graph
- Randomized Approximation Algorithms for Query Optimization Problems on Two Processors \Lambda
- On Two-Stage Stochastic Minimum Spanning Kedar Dhamdhere1
- COMBINATORICA Akad6miai Kind6 -Springer-Verlag
- On 2coverings and 2packings of laminar families J. Cheriyan \Lambda T. Jord'an y R. Ravi z
- Algorithmica (1997~ 18:21-43 AlgorithmicaO 1997Springer-VerlagNew YorkInc.
- The Constrained Minimum Spanning Tree (Extended Abstract)
- [23] M. S. Waterman, ``Secondary structure of singlestranded nucleic acids,'' Studies in Foundations and Combinatorics, Advances in Math
- Dial a Ride from k-Forest ANUPAM GUPTA
- Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest
- Haplotyping for Disease Association: A Combinatorial Approach
- An Approximation Algorithm for the Covering Steiner Problem Goran Konjevod \Lambda R. Ravi y
- Approximation Algorithms for Minimizing Average Distortion Kedar Dhamdhere # Anupam Gupta + R. Ravi #
- Approximation Algorithms for the Covering Steiner Problem Goran Konjevod y R. Ravi z Aravind Srinivasan x
- Approximation Algorithms for Requirement cut Viswanath Nagarajan # and R. Ravi ##
- MATHEMATICS OF OPERATIONS RESEARCH Vol. 32, No. 2, May 2007, pp. 345364
- Erratum: An Approximation Algorithm for MinimumCost VertexConnectivity Problems
- Theoretical ComputerScience
- GESTALT: Genomic Steiner Alignments Giuseppe Lancia ?1 and R. Ravi ??2
- Approximation Algorithms for DegreeConstrained MinimumCost NetworkDesign Problems 4
- INFORMS Journal on Computing Vol. 20, No. 2, Spring 2008, pp. 243254
- Game-Theoretic Models of Information Overload in Social Networks
- Journal of Computer and System Sciences 58, 101 108 (1999) A Constant-Factor Approximation Algorithm for the k-MST Problem
- Multicommodity Facility Location Multicommodity facility location refers to the extension
- E-appendix for Integrated Optimization of Customer and Supplier Logistics at
- Matching Based Augmentations for Approximating Connectivity Problems
- Approximation Algorithms for a Capacitated Network Design Problem
- Approximation algorithms for the test cover K.M.J. De Bontridder B.V. Halld orsson y
- A Matter of Degree: Improved Approximation Algorithms for DegreeBounded Minimum Spanning Trees
- Approximation Algorithms for a Capacitated Network Design Problem R. Hassin y R. Ravi z F. S. Salman x
- Operations Research Letters 38 (2010) 322325 Contents lists available at ScienceDirect
- Finding Effective Support-Tree Preconditioners Bruce M. Maggs
- Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
- Iterative Rounding for Multi-Objective Optimization Problems
- Banishing Bias from Consensus Sequences Amir BenDor 1 , Giuseppe Lancia 2 , Jennifer Perone 3 , and R. Ravi 2
- Improving Minimum Cost Spanning Trees by Upgrading Nodes \Lambda
- Ordering problems approximated: single-processor scheduling and interval
- , , 1--35 () fl Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- On 2Coverings and 2Packings of Laminar Joseph Cheriyan 1? , Tibor Jord'an 2?? , and R. Ravi 3? ? ?
- Math. Program., Ser. A (2011) 126:401405 DOI 10.1007/s10107-009-0287-4
- Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network
- DOI: 10.1007/s00224-005-1259-6 Theory Comput. Systems 39, 93111 (2006)
- Capacitated Vehicle Routing with Non-Uniform Inge Li Grtz, Marco Molinaro
- Bicriteria Network Design Problems MADHAV V. MARATHE \Lambda R. RAVI y RAVI SUNDARAM z S. S. RAVI x
- A New Bound for the 2Edge Connected Subgraph Problem
- PRIMAL-DUAL MEETS LOCAL SEARCH: APPROXIMATING MST'S WITH NONUNIFORM DEGREE BOUNDS
- Discrete Optimization Approximating k-cuts using network strength
- Thresholded Covering Algorithms for Robust and Max-min Optimization
- When cycles collapse: A general approximation technique for constrained
- Combinatorics, Probability and Computing (2009) 18, 145163. c 2008 Cambridge University Press doi:10.1017/S0963548308009334 Printed in the United Kingdom
- A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- Approximation Algorithms for Distance Constrained Vehicle Routing Problems
- Dial a Ride from k-forest Anupam Gupta
- Quasi-Polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost
- Approximation Algorithms for the Covering Steiner Problem Goran Konjevod y R. Ravi z Aravind Srinivasan x
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics
- Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel
- Reconstructing edge-disjoint paths M. Conforti R. Hassin y R. Ravi z
- Operations Research Letters 34 (2006) 499507 www.elsevier.com/locate/orl
- Approximation through multicommodity flow Philip Klein4 Ajit Agrawalt R. Ravit Satish RaoJ
- Approximation Algorithms for Finding Low-Degree Philip N. Klein
- Approximating Maximum Leaf Spanning Trees in Almost Linear hil@cs.ccu.edu.tw
- Scheduling and Reliable Lead-Time Quotation for Orders with
- Algorithmica DOI 10.1007/s00453-011-9509-2
- We Know Who You Followed Last Summer: Inferring Social Link Creation Times in Twitter
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- Tree Embeddings for Two-Edge-Connected Network Design Anupam Gupta
- Algorithmica (2010) 56: 198213 DOI 10.1007/s00453-008-9171-5
- Innovative Applications of O.R. Integrated optimization of customer and supplier logistics at Robert Bosch LLC
- Operations Research Letters 38 (2010) 161164 Contents lists available at ScienceDirect
- LIPIcs Leibniz International Proceedings in Informatics Iterative Methods in Combinatorial
- Minimum Makespan Multi-vehicle Dial-a-Ride Inge Li Grtz , Viswanath Nagarajan, and R. Ravi
- Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction
- Delegate and Conquer: An LP-based approximation algorithm for Minimum Degree
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- Digital Object Identifier (DOI) 10.1007/s10107-005-0673-5 Math. Program., Ser. A 108, 97114 (2006)
- Boosted Sampling: Approximation Algorithms for Stochastic Optimization
- Boosted Sampling: Approximation Algorithms for Stochastic Optimization
- SIAM J. DISCRETE MATH. Vol. 9, No. 2 pp. 178-200, May 1996
- Computing similarity between RNA strings* Vineet Bafna t S. Muthukrishnan * R. Ravi w
- Of Mice and Men: Algorithms for Evolutionary Distances Between Genomes with Translocation
- Carnegie Mellon University Research Showcase
- ELSEVIER Information Processing Letters 50 (1994) 185-190 Information
- Many birds with one stone: Multi-objective approximation algorithms (Extended Abstract)
- The Power of Local Optimization: Approximation Algorithms for
- An Optimal Algorithm to Solve the All-Pair Shortest Path Problem on Interval Graphs
- Discrete Applied Mathematics 39 (1992) 87-93 North-Holland
- Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces
- The pNeighbor kCenter Problem Shiva Chaudhuri \Lambda Naveen Garg \Lambda R. Ravi y
- The Power of Local Optimization: Approximation Algorithms for Maximum-Leaf Spanning Tree
- IEEE TRANSACTIONS ON COMPUTERS, VOL. 47, NO. 3, MARCH 1998 273 Optimal Circuits for Parallel Multipliers
- Line-of-Sight Networks Alan Frieze
- Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
- Worst-Case Payoffs of a Location Game Shuchi Chawla
- Min-Max Payoffs in a Two-Player Location Game We consider a two-player, sequential location game in d-dimensional Euclidean
- Design Strategies for Optimal Multiplier Circuits Charles Martel \Lambda Vojin Oklobdzija
- Operations Research Letters 38 (2010) 156160 Contents lists available at ScienceDirect
- A MATTER OF DEGREE: IMPROVED APPROXIMATION ALGORITHMS FOR
- PrimalDual Meets Local Search: Approximating MST's With Nonuniform Degree Bounds #
- Information Processing Letters 80 (2001) 213219 On approximating planar metrics by tree metrics
- Min-Max Tree Covers of Graphs J. Konemann
- How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
- A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting
- Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits Anupam Gupta Ravishankar Krishnaswamy Marco Molinaro R. Ravi
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. COMPUT. c 2011 Society for Industrial and Applied Mathematics
- Approximation Algorithms for Stochastic Orienteering Anupam Gupta
