Mohammad R. Salavatipour
According to our database^{1},
Mohammad R. Salavatipour
authored at least 54 papers
between 2000 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepage:

at orcid.org
On csauthors.net:
Bibliography
2020
Approximations for Throughput Maximization.
CoRR, 2020
Asymptotic QuasiPolynomial Time Approximation Scheme for Resource Minimization for Fire Containment.
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020
2019
Approximation Schemes for Clustering with Outliers.
ACM Trans. Algorithms, 2019
Local Search Yields a PTAS for kMeans in Doubling Metrics.
SIAM J. Comput., 2019
Scheduling problems over a network of machines.
J. Sched., 2019
LPBased Approximation Algorithms for Facility Location in BuyatBulk Network Design.
Algorithmica, 2019
Approximation Algorithms for MinSum kClustering and Balanced kMedian.
Algorithmica, 2019
Exact Algorithms and Lower Bounds for Stable Instances of Euclidean kMEANS.
Proceedings of the Thirtieth Annual ACMSIAM Symposium on Discrete Algorithms, 2019
2018
Approximation Algorithms for MinimumLoad kFacility Location.
ACM Trans. Algorithms, 2018
Minimizing Latency of Capacitated kTours.
Algorithmica, 2018
2016
Improved approximations for buyatbulk and shallowlight kSteiner trees and (k, 2)subgraph.
J. Comb. Optim., 2016
How to Walk Your Dog in the Mountains with No Magic Leash.
Discret. Comput. Geom., 2016
New Approximation Algorithms for the Unsplittable Capacitated Facility Location Problem.
Algorithmica, 2016
Approximating Connected Facility Location with Lower and Upper Bounds via LP Rounding.
Proceedings of the 15th Scandinavian Symposium and Workshops on Algorithm Theory, 2016
Approximation Algorithms for Capacitated kTravelling Repairmen Problems.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016
2015
On Minimum Sum of Radii and Diameters Clustering.
Algorithmica, 2015
2014
A logarithmic approximation for unsplittable flow on line graphs.
ACM Trans. Algorithms, 2014
Improved Approximation Algorithms for the Minmax Tree Cover and Bounded Tree Cover Problems.
Algorithmica, 2014
Approximation Algorithms for MinimumLoad kFacility Location.
Proceedings of the Approximation, 2014
2013
Asymmetric Traveling Salesman Path and Directed Latency Problems.
SIAM J. Comput., 2013
Twostage Robust Network Design with Exponential Scenarios.
Algorithmica, 2013
2012
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs.
Algorithmica, 2012
2011
Minimizing movement in mobile facility location problems.
ACM Trans. Algorithms, 2011
A Constant Factor Approximation for Minimum λEdgeConnected kSubgraph with Metric Costs.
SIAM J. Discret. Math., 2011
Approximability of Packing Disjoint Cycles.
Algorithmica, 2011
2010
Approximation Algorithms for Nonuniform BuyatBulk Network Design.
SIAM J. Comput., 2010
2009
Survivable Network Design with Degree or Order Constraints.
SIAM J. Comput., 2009
A PTAS for Minimum Clique Partition in Unit Disk Graphs
CoRR, 2009
Approximating BuyatBulk and ShallowLight kSteiner Trees.
Algorithmica, 2009
2008
Combination Can Be Hard: Approximability of the Unique Coverage Problem.
SIAM J. Comput., 2008
A Constant Factor Approximation for Minimum lambdaEdgeConnected kSubgraph with Metric Costs.
Proceedings of the Approximation, 2008
2007
Approximation algorithms and hardness results for cycle packing problems.
ACM Trans. Algorithms, 2007
Packing elementdisjoint steiner trees.
ACM Trans. Algorithms, 2007
The Resolution Complexity of Random Constraint Satisfaction Problems.
SIAM J. Comput., 2007
Recall Systems: Effcient Learning and Use of Category Indices.
Proceedings of the Eleventh International Conference on Artificial Intelligence and Statistics, 2007
Selecting dissimilar genes for multiclass classification, an application in cancer subtyping.
BMC Bioinform., 2007
Approximation algorithms for nodeweighted buyatbulk network design.
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
Selecting Genes with Dissimilar Discrimination Strength for Sample Class Prediction.
Proceedings of 5th AsiaPacific Bioinformatics Conference, 2007
2006
Large Induced Forests in TriangleFree Planar Graphs.
Graphs Comb., 2006
Polylogarithmic Approximation Algorithm for NonUniform Multicommodity BuyatBulk
Electronic Colloquium on Computational Complexity (ECCC), 2006
Approximating BuyatBulk kSteiner trees
Electronic Colloquium on Computational Complexity (ECCC), 2006
Hardness and Approximation Results for Packing Steiner Trees.
Algorithmica, 2006
Approximation Algorithms for NonUniform BuyatBulk Network Design.
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.
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.
J. Comb. Theory, Ser. B, 2005
Planar graphs without cycles of length from 4 to 7 are 3colorable.
J. Comb. Theory, Ser. B, 2005
Disjoint Cycles: Integrality Gap, Hardness, and Approximation.
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.
Random Struct. Algorithms, 2004
A polynomial time algorithm for strong edge coloring of partial ktrees.
Discret. Appl. Math., 2004
2003
On Sum Coloring of Graphs.
Discret. Appl. Math., 2003
A (1+epsilon)approximation algorithm for partitioning hypergraphs using a new algorithmic version of the Lovász Local Lemma.
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
Packing Steiner trees.
Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2003
2002
Frequency Channel Assignment on Planar Networks.
Proceedings of the Algorithms, 2002
2000
On a conjecture of Keedwell and the cycle double cover conjecture.
Discret. Math., 2000