Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Parekh, Ojas - Department of Mathematics and Computer Science, Emory University
Edge dominating and hypomatchable sets Ojas Parekh
Finding Effective Support-Tree Preconditioners Bruce M. Maggs1
10 -Approximation Algorithm for a Generalization of the Weighted
Randomized Approximation Algorithms for Query Optimization Problems on Two
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Compacting cuts: a new linear formulation for minimum cut Robert D. Carr
A Unified Approach to Approximating Partial Covering Problems Jochen Konemann
Forestation in hypergraphs: linear k-trees Ojas Parekh
POLYHEDRAL TECHNIQUES FOR GRAPHIC COVERING PROBLEMS
