Mohammad R. Salavatipour

According to our database, Mohammad R. Salavatipour authored at least 68 papers between 2000 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Approximations for Throughput Maximization.

Dylan Hyatt-Denesik, Mirmahdi Rahgoshay, Mohammad R. Salavatipour

Algorithmica, May, 2024

Approximation schemes for Min-Sum k-Clustering.

Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour

Discret. Optim., 2024

A QPTAS for Facility Location on Unit Disk graphs.

Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, Hao Sun

CoRR, 2024

Approximation Schemes for Orienteering and Deadline TSP in Doubling Metrics.

Kinter Ren, Mohammad R. Salavatipour

CoRR, 2024

Approximation Algorithms for the Airport and Railway Problem.

Mohammad R. Salavatipour, Lijiangnan Tian

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Preface to the Special Issue on the 17th Algorithms and Data Structures Symposium (WADS 2021).

Meng He, Anna Lubiw, Mohammad R. Salavatipour

Algorithmica, June, 2023

Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension.

Aditya Jayaprakash, Mohammad R. Salavatipour

ACM Trans. Algorithms, April, 2023

Preface.

Meng He, Anna Lubiw, Mohammad R. Salavatipour

Comput. Geom., 2023

2022

Asymptotic Quasi-Polynomial Time Approximation Scheme for Resource Minimization for Fire Containment.

Mirmahdi Rahgoshay, Mohammad R. Salavatipour

Algorithmica, 2022

Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands.

Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour

Proceedings of the Integer Programming and Combinatorial Optimization, 2022

2021

Improved Approximations for CVRP with Unsplittable Demands.

Zachary Friggstad, Ramin Mousavi, Mirmahdi Rahgoshay, Mohammad R. Salavatipour

CoRR, 2021

Hierarchical Clustering: New Bounds and Objective.

Mirmahdi Rahgoshay, Mohammad R. Salavatipour

CoRR, 2021

Special Issue on Algorithms and Data Structures (WADS 2019).

Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour

Algorithmica, 2021

2020

Preface.

Zachary Friggstad, Jörg-Rüdiger Sack, Mohammad R. Salavatipour

Comput. Geom., 2020

Approximation Algorithms for Generalized Path Scheduling.

Haozhou Pang, Mohammad R. Salavatipour

Proceedings of the 31st International Symposium on Algorithms and Computation, 2020

2019

Approximation Schemes for Clustering with Outliers.

Zachary Friggstad, Kamyar Khodamoradi, Mohsen Rezapour, Mohammad R. Salavatipour

ACM Trans. Algorithms, 2019

Local Search Yields a PTAS for k-Means in Doubling Metrics.

Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour

SIAM J. Comput., 2019

Scheduling problems over a network of machines.

Zachary Friggstad, Arnoosh Golestanian, Kamyar Khodamoradi, Christopher S. Martin, Mirmahdi Rahgoshay, Mohsen Rezapour, Mohammad R. Salavatipour, Yifeng Zhang

J. Sched., 2019

LP-Based Approximation Algorithms for Facility Location in Buy-at-Bulk Network Design.

Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour, José A. Soto

Algorithmica, 2019

Approximation Algorithms for Min-Sum k-Clustering and Balanced k-Median.

Babak Behsaz, Zachary Friggstad, Mohammad R. Salavatipour, Rohit Sivakumar

Algorithmica, 2019

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-MEANS.

Zachary Friggstad, Kamyar Khodamoradi, Mohammad R. Salavatipour

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018

Approximation Algorithms for Minimum-Load <i>k</i>-Facility Location.

Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy

ACM Trans. Algorithms, 2018

Minimizing Latency of Capacitated k-Tours.

Christopher S. Martin, Mohammad R. Salavatipour

Algorithmica, 2018

2016

Improved approximations for buy-at-bulk and shallow-light k-Steiner trees and (k, 2)-subgraph.

M. Reza Khani, Mohammad R. Salavatipour

J. Comb. Optim., 2016

How to Walk Your Dog in the Mountains with No Magic Leash.

Sariel Har-Peled, Amir Nayyeri, Mohammad R. Salavatipour, Anastasios Sidiropoulos

Discret. Comput. Geom., 2016

New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.

Babak Behsaz, Mohammad R. Salavatipour, Zoya Svitkina

Algorithmica, 2016

Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.

Zachary Friggstad, Mohsen Rezapour, Mohammad R. Salavatipour

Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016

Approximation Algorithms for Capacitated k-Travelling Repairmen Problems.

Christopher S. Martin, Mohammad R. Salavatipour

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2015

On Minimum Sum of Radii and Diameters Clustering.

Babak Behsaz, Mohammad R. Salavatipour

Algorithmica, 2015

2014

A logarithmic approximation for unsplittable flow on line graphs.

Nikhil Bansal, Zachary Friggstad, Rohit Khandekar, Mohammad R. Salavatipour

ACM Trans. Algorithms, 2014

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems.

M. Reza Khani, Mohammad R. Salavatipour

Algorithmica, 2014

Approximation Algorithms for Minimum-Load k-Facility Location.

Sara Ahmadian, Babak Behsaz, Zachary Friggstad, Amin Jorati, Mohammad R. Salavatipour, Chaitanya Swamy

Proceedings of the Approximation, 2014

2013

Asymmetric Traveling Salesman Path and Directed Latency Problems.

Zachary Friggstad, Mohammad R. Salavatipour, Zoya Svitkina

SIAM J. Comput., 2013

Two-stage Robust Network Design with Exponential Scenarios.

Rohit Khandekar, Guy Kortsarz, Vahab S. Mirrokni, Mohammad R. Salavatipour

Algorithmica, 2013

2012

A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.

Imran A. Pirwani, Mohammad R. Salavatipour

Algorithmica, 2012

2011

Minimizing movement in mobile facility location problems.

Zachary Friggstad, Mohammad R. Salavatipour

ACM Trans. Algorithms, 2011

A Constant Factor Approximation for Minimum <i>λ</i>-Edge-Connected <i>k</i>-Subgraph with Metric Costs.

MohammadAli Safari, Mohammad R. Salavatipour

SIAM J. Discret. Math., 2011

Approximability of Packing Disjoint Cycles.

Zachary Friggstad, Mohammad R. Salavatipour

Algorithmica, 2011

2010

Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design.

Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour

SIAM J. Comput., 2010

2009

Survivable Network Design with Degree or Order Constraints.

Lap Chi Lau, Joseph Naor, Mohammad R. Salavatipour, Mohit Singh

SIAM J. Comput., 2009

A PTAS for Minimum Clique Partition in Unit Disk Graphs

Imran A. Pirwani, Mohammad R. Salavatipour

CoRR, 2009

Approximating Buy-at-Bulk and Shallow-Light <i>k</i>-Steiner Trees.

Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour

Algorithmica, 2009

2008

Combination Can Be Hard: Approximability of the Unique Coverage Problem.

Erik D. Demaine, Uriel Feige, MohammadTaghi Hajiaghayi, Mohammad R. Salavatipour

SIAM J. Comput., 2008

A Constant Factor Approximation for Minimum lambda-Edge-Connected k-Subgraph with Metric Costs.

MohammadAli Safari, Mohammad R. Salavatipour

Proceedings of the Approximation, 2008

2007

Approximation algorithms and hardness results for cycle packing problems.

Michael Krivelevich, Zeev Nutov, Mohammad R. Salavatipour, Jacques Verstraëte, Raphael Yuster

ACM Trans. Algorithms, 2007

Packing element-disjoint steiner trees.

Joseph Cheriyan, Mohammad R. Salavatipour

ACM Trans. Algorithms, 2007

The Resolution Complexity of Random Constraint Satisfaction Problems.

Michael Molloy, Mohammad R. Salavatipour

SIAM J. Comput., 2007

Recall Systems: Effcient Learning and Use of Category Indices.

Omid Madani, Wiley Greiner, David Kempe, Mohammad R. Salavatipour

Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007

Selecting dissimilar genes for multi-class classification, an application in cancer subtyping.

Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Guohui Lin

BMC Bioinform., 2007

Approximation algorithms for node-weighted buy-at-bulk network design.

Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction.

Zhipeng Cai, Randy Goebel, Mohammad R. Salavatipour, Yi Shi, Lizhe Xu, Guohui Lin

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

Large Induced Forests in Triangle-Free Planar Graphs.

Mohammad R. Salavatipour

Graphs Comb., 2006

Polylogarithmic Approximation Algorithm for Non-Uniform Multicommodity Buy-at-Bulk

Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour

Electron. Colloquium Comput. Complex., 2006

Approximating Buy-at-Bulk k-Steiner trees

Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour

Electron. Colloquium Comput. Complex., 2006

Hardness and Approximation Results for Packing Steiner Trees.

Joseph Cheriyan, Mohammad R. Salavatipour

Algorithmica, 2006

Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design.

Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Kortsarz, Mohammad R. Salavatipour

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

Using Gene Clustering to Identify Discriminatory Genes with Higher Classification Accuracy.

Zhipeng Cai, Lizhe Xu, Yi Shi, Mohammad R. Salavatipour, Randy Goebel, Guohui Lin

Proceedings of the Sixth IEEE International Symposium on BioInformatics and BioEngineering (BIBE 2006), 2006

2005

A bound on the chromatic number of the square of a planar graph.

Michael Molloy, Mohammad R. Salavatipour

J. Comb. Theory B, 2005

Planar graphs without cycles of length from 4 to 7 are 3-colorable.

Oleg V. Borodin, Alexei N. Glebov, André Raspaud, Mohammad R. Salavatipour

J. Comb. Theory B, 2005

Disjoint Cycles: Integrality Gap, Hardness, and Approximation.

Mohammad R. Salavatipour, Jacques Verstraëte

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

A (1 + varepsilon )-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lova'sz Local Lemma.

Mohammad R. Salavatipour

Random Struct. Algorithms, 2004

A polynomial time algorithm for strong edge coloring of partial <i>k</i>-trees.

Mohammad R. Salavatipour

Discret. Appl. Math., 2004

2003

Graph colouring via the discharging method.

Mohammad R. Salavatipour

PhD thesis, 2003

On Sum Coloring of Graphs.

Mohammad R. Salavatipour

Discret. Appl. Math., 2003

A (1+epsilon)-approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma.

Mohammad R. Salavatipour

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Packing Steiner trees.

Kamal Jain, Mohammad Mahdian, Mohammad R. Salavatipour

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

2002

Frequency Channel Assignment on Planar Networks.

Michael Molloy, Mohammad R. Salavatipour

Proceedings of the Algorithms, 2002

2000

On a conjecture of Keedwell and the cycle double cover conjecture.

Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani

Discret. Math., 2000