Mohammad Salavatipour
Mohammad Salavatipour
Professor of Computer Science, University of Alberta
Bestätigte E-Mail-Adresse bei cs.ualberta.ca - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Packing steiner trees
K Jain, M Mahdian, MR Salavatipour
SODA 3, 266-274, 2003
2502003
A bound on the chromatic number of the square of a planar graph
M Molloy, MR Salavatipour
Journal of Combinatorial Theory, Series B 94 (2), 189-213, 2005
2062005
Combination can be hard: Approximability of the unique coverage problem
ED Demaine, U Feige, MT Hajiaghayi, MR Salavatipour
SIAM Journal on Computing 38 (4), 1464-1483, 2008
1552008
Planar graphs without cycles of length from 4 to 7 are 3-colorable
OV Borodin, AN Glebov, A Raspaud, MR Salavatipour
Journal of Combinatorial Theory, Series B 93 (2), 303-311, 2005
1502005
Survivable network design with degree or order constraints
LC Lau, J Naor, MR Salavatipour, M Singh
SIAM Journal on Computing 39 (3), 1062-1087, 2009
1482009
Local Search Yields a PTAS for -Means in Doubling Metrics
Z Friggstad, M Rezapour, MR Salavatipour
SIAM Journal on Computing 48 (2), 452-480, 2019
882019
Frequency channel assignment on planar networks
M Molloy, MR Salavatipour
European Symposium on Algorithms, 736-747, 2002
832002
Approximation algorithms for non-uniform buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
632006
Primal dual gives almost optimal energy-efficient online algorithms
NR Devanur, Z Huang
ACM Transactions on Algorithms (TALG) 14 (1), 1-30, 2017
622017
Minimizing movement in mobile facility location problems
Z Friggstad, MR Salavatipour
ACM Transactions on Algorithms (TALG) 7 (3), 1-22, 2011
582011
Approximation algorithms and hardness results for cycle packing problems
M Krivelevich, Z Nutov, MR Salavatipour, J Verstraete, R Yuster
ACM Transactions on Algorithms (TALG) 3 (4), 48-es, 2007
582007
A logarithmic approximation for unsplittable flow on line graphs
N Bansal, Z Friggstad, R Khandekar, MR Salavatipour
Proceedings of the twentieth annual ACM-SIAM symposium on Discrete …, 2009
572009
On sum coloring of graphs
MR Salavatipour
Discrete Applied Mathematics 127 (3), 477-488, 2003
552003
Hardness and approximation results for packing Steiner trees
J Cheriyan, MR Salavatipour
Algorithmica 45 (1), 21-43, 2006
502006
Selecting dissimilar genes for multi-class classification, an application in cancer subtyping
Z Cai, R Goebel, MR Salavatipour, G Lin
BMC bioinformatics 8 (1), 206, 2007
452007
Approximation algorithms for nonuniform buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
SIAM Journal on Computing 39 (5), 1772-1798, 2010
442010
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
MR Khani, MR Salavatipour
Algorithmica 69 (2), 443-460, 2014
422014
The resolution complexity of random constraint satisfaction problems
M Molloy, M Salavatipour
44th Annual IEEE Symposium on Foundations of Computer Science, 2003 …, 2003
40*2003
Approximation algorithms for node-weighted buy-at-bulk network design
C Chekuri, MT Hajiaghayi, G Kortsarz, MR Salavatipour
Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete …, 2007
382007
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
MT Hajiaghayi, G Kortsarz, MR Salavatipour
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2006
332006
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20