Browse
Ramamoorthi Ravi
Ramamoorthi's public data
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints
Niv Buchbinder
2015-07-01T00:00:00Z
Geometry of Online Packing Linear Programs
Marco Molinaro
2014-01-01T00:00:00Z
journal contribution
Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data.
Ming-Chi Tsai
2013-09-01T00:00:00Z
A mixed integer linear programming model to reconstruct phylogenies from single nucleotide polymorphism haplotypes under the maximum parsimony criterion.
Daniele Catanzaro
2013-01-01T00:00:00Z
Bicriteria Network Design Problems
Madhav V. Marathe
2012-09-01T00:00:00Z
A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning Trees
J. Könemann
2012-05-01T00:00:00Z
Primal-Dual Meets Local Search: Approximating MSTs With Nonuniform Degree Bounds
J. Könemann
2012-05-01T00:00:00Z
An optimization-based sampling scheme for phylogenetic trees.
Navodit Misra
2011-11-01T00:00:00Z
Nonoverlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles)
Vineet Bafna
2011-11-01T00:00:00Z
Iterative Rounding for Multi-Objective Optimization Problems
Fabrizio Grandoni
2011-07-01T00:00:00Z
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
Srinath Sridhar
2011-06-01T00:00:00Z
Capacitated Vehicle Routing with Non-uniform Speeds
Inge Li Gortz
2011-04-12T00:00:00Z
Generalized buneman pruning for inferring the most parsimonious multi-state phylogeny.
Navodit Misra
2011-03-01T00:00:00Z
Quasi-polynomial Time Approximation Algorithm for Low-Degree Minimum-Cost Steiner Trees
Jochen Könemann
2010-07-01T00:00:00Z
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
Viswanath Nagarajan
2010-05-11T00:00:00Z
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
Srinath Sridhar
2010-03-01T00:00:00Z
An FPTAS for Minimizing a Class of Low-Rank Quasi-Concave Functions over a Convex Set
Vineet Goyal
2009-10-01T00:00:00Z
Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
Anupam Gupta
2008-08-01T00:00:00Z
Thresholded Covering Algorithms for Robust and Max-Min Optimization
Anupam Gupta
2008-07-01T00:00:00Z
The Directed Minimum Latency Problem
Viswanath Nagarajan
2008-04-01T00:00:00Z
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice
Srinath Sridhar
2008-01-01T00:00:00Z
Chance Constrained Knapsack Problem with Random Item Sizes
Vineet Goyal
2008-01-01T00:00:00Z
Direct Maximum Parsimony Phylogeny Reconstruction from Genotype Data.
Srinath Sridhar
2007-10-01T00:00:00Z
Line-of-Sight Networks
Alan Frieze
2007-03-01T00:00:00Z
Parallelizing Elimination Orders with Linear Fill
Claudson Bornstein
2007-01-01T00:00:00Z
An FPTAS for Minimizing the Product of Two Non-negative Linear Cost Functions
Vineet Goyal
2006-09-01T00:00:00Z
Profit Maximizing Mechanisms for the Extended Multicasting Game
Shuchi Chawla
2006-05-01T00:00:00Z
Approximating the Single-Sink Link-Installation Problem in Network Design
F. S. Salman
2005-08-01T00:00:00Z
Sort-Cut: A Pareto Optimal and Semi-Truthful Mechanism for Multi-Unit Auctions with Budget-Constrained Bidders
Isa Hafalir
2005-08-01T00:00:00Z
A Polylogarithmic Approximation Algorithm for the Group Steiner Problem
Naveen Garg
2005-06-01T00:00:00Z
Tree Embeddings for Two-Edge-Connected Network Design
Anupam Gupta
2005-05-01T00:00:00Z
How to Pay, ComeWhat May: Approximation Algorithms for Demand-Robust Covering Problems
Kedar Dhamdhere
2004-01-01T00:00:00Z
Approximation Algorithms for Robust Covering Problems with Chance Constraints
Vineet Goyal
2003-11-01T00:00:00Z
Haplotyping for Disease Association: A Combinatorial Approach
Guiseppe Lancia
2002-02-01T00:00:00Z
Approximation Algorithms for Low-Distortion Embeddings Into Low-Dimensional Spaces
Mihai Badiou
2001-05-01T00:00:00Z
Multicommodity Facility Location
Ramamoorthi Ravi
2000-10-01T00:00:00Z
Boosted Sampling: Approximation Algorithms for Stochastic Optimization
Anupam Gupta
2000-09-01T00:00:00Z
A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Bang Ye Wu
1999-10-01T00:00:00Z
Optimal Imperfect Phylogeny Reconstruction and Haplotyping (IPPH)
Srinath Sridhar
1999-07-01T00:00:00Z
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
Guy Blelloch
1997-01-01T00:00:00Z
