Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Salavatipour, Mohammad R. - Department of Computing Science, University of Alberta
A logarithmic approximation for unsplittable flow on line graphs Nikhil Bansal
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Asymmetric Traveling Salesman Path and Directed Latency Problems
Hardness and Approximation Results for Packing Steiner Trees Joseph Cheriyan
A bound on the chromatic number of the square of a planar graph
The Three Color Problem for Planar Graphs Mohammad R. Salavatipour
APPROXIMATION ALGORITHMS FOR NON-UNIFORM BUY-AT-BULK NETWORK DESIGN
Survivable Network Design with Degree or Order Constraints # Lap Chi Lau + Joseph (Seffi) Naor # Mohammad R. Salavatipour Mohit Singh
Large Induced Forests in Triangle-free Planar Graphs Mohammad R. Salavatipour
Approximability of Packing Disjoint Cycles # Zachary Friggstad + Mohammad R. Salavatipour +
Approximating BuyatBulk and Shallowlight kSteiner trees # MohammadTaghi Hajiaghayi + Guy Kortsarz # Mohammad R. Salavatipour
Packing Steiner trees Microsoft Research
Approximation Algorithms for NodeWeighted BuyatBulk Network Design
Combination Can Be Hard: Approximability of the Unique Coverage Problem #
On Sum Coloring of Graphs Mohammadreza Salavatipour
On Sum Coloring of Graphs Mohammad R. Salavatipour
The Resolution Complexity of Random Constraint Satisfaction Michael Molloy
Packing ElementDisjoint Steiner Trees Joseph Cheriyan
A constant factor approximation for minimum #edgeconnected ksubgraph with metric costs
A Polynomial Time Algorithm for Strong Edge Coloring of Partial Mohammad R. Salavatipour
Recall Systems: Efficient Learning and Use of Category Indices Omid Madani
Graph Colouring via the Discharging Method Mohammad R. Salavatipour
Minimizing Movement in Mobile Facility Location Problems Zachary Friggstad
Minimizing Movement in Mobile Facility Location Problems Zachary Friggstad
Two-stage Robust Network Design with Exponential Scenarios Rohit Khandekar
Frequency Channel Assignment on Planar Michael Molloy ?? and Mohammad R. Salavatipour ? ? ?
Disjoint Cycles: Integrality Gap, Hardness, and Approximation
Approximation Algorithms for NonUniform BuyatBulk Network Design C. Chekuri # M. T. Hajiaghayi + G. Kortsarz # M. R. Salavatipour
Planar graphs without cycles of length from 4 to 7 are 3-colorable O. V. Borodin
A (1 + )-Approximation Algorithm for Partitioning Hypergraphs Using a New Algorithmic Version of the Lov asz Local Lemma
Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems
Asymmetric Traveling Salesman Path and Directed Latency Problems
Minimizing Movement in Mobile Facility Location Problems Zachary Friggstad
Improved Approximations for Buy-at-bulk and Shallow-Light k-Steiner Trees and (k, 2)-Subgraph
A Logarithmic Approximation for Unsplittable Flow on Line Graphs NIKHIL BANSAL, Eindhoven University of Technology