Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[3]
Hilfe
Suche: Author="Salavatipour, Mohammad R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
M. Reza Khani
,
Mohammad R. Salavatipour
Algorithmica
69
(2), 2014, pp. 443-460
Asymmetric Traveling Salesman path and directed latency problems
Zachary Friggstad
,
Mohammad R. Salavatipour
,
Zoya Svitkina
SIAM Journal on Computing
42
(4), 2013, pp. 1596-1619
Two-stage robust network design with exponential scenarios
Rohit Khandekar
,
Guy Kortsarz
,
Vahab Mirrokni
,
Mohammad R. Salavatipour
Algorithmica
65
(2), 2013, pp. 391-408
New approximation algorithms for the unsplittable capacitated facility location problem
Babak Behsaz
,
Mohammad R. Salavatipour
,
Zoya Svitkina
Lecture Notes in Computer Science
7357
, 2012, pp. 237-248
On minimum sum of Radii and diameters clustering
Babak Behsaz
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
7357
, 2012, pp. 71-82
A weakly robust PTAS for minimum clique partition in unit disk graphs
Imran A. Pirwani
,
Mohammad R. Salavatipour
Algorithmica
62
(3-4), 2012, pp. 1050-1072
Approximability of packing disjoint cycles
Zachary Friggstad
,
Mohammad R. Salavatipour
Algorithmica
60
(2), 2011, pp. 395-400
Improved approximations for Buy-at-Bulk and Shallow-Light
k
-Steiner trees and
(k,2)
-subgraph
M. Reza Khani
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
7074
, 2011, pp. 20-29
A constant factor approximation for minimum
\lambda
-edge-connected
k
-subgraph with metric costs
Mohammad Ali Safari
,
Mohammad R. Salavatipour
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1089-1102
A weakly robust PTAS for minimum clique partition in unit disk graphs
Imran A. Pirwani
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
6139
, 2010, pp. 188-199
Approximating buy-at-bulk and shallow-light
k
-Steiner trees
Mohammad Taghi Hajiaghayi
,
Guy Kortsarz
,
Mohammad R. Salavatipour
Algorithmica
53
(1), 2009, pp. 89-103
Survivable network design with degree or order constraints
Lap Chi Lau
,
Joseph (Seffi) Naor
,
Mohammad R. Salavatipour
,
Mohit Singh
SIAM Journal on Computing
39
(3), 2009, pp. 1062-1087
Combination can be hard: Approximability of the unique coverage problem
Erik D. Demaine
,
Uriel Feige
,
MohammadTaghi Hajiaghayi
,
Mohammad R. Salavatipour
SIAM Journal on Computing
38
(4), 2008, pp. 1464-1483
Two-stage robust network design with exponential scenarios
Rohit Khandekar
,
Guy Kortsarz
,
Vahab Mirrokni
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
5193
, 2008, pp. 589-600
Approximability of packing disjoint cycles
Zachary Friggstad
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
4835
, 2007, pp. 304-315
Survivable network design with degree or order constraints
Lap Chi Lau
,
Joseph (Seffi) Naor
,
Mohammad R. Salavatipour
,
Mohit Singh
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 651-660
The resolution complexity of random constraint satisfaction problems
Michael Molloy
,
Mohammad R. Salavatipour
SIAM Journal on Computing
37
(3), 2007, pp. 895-922
Hardness and approximation results for packing Steiner trees
Joseph Cheriyan
,
Mohammad R. Salavatipour
Algorithmica
45
(1), 2006, pp. 21-43
Large induced forests in triangle-free planar graphs
Mohammad R. Salavatipour
Graphs and Combinatorics
22
(1), 2006, pp. 113-126
A bound on the chromatic number of the square of a planar graph
Michael Molloy
,
Mohammad R. Salavatipour
Journal of Combinatorial Theory Series B
94
(2), 2005, pp. 189-213
Disjoint cycles: Integrality gap, hardness, and approximation
Mohammad R. Salavatipour
,
Jacques Verstraete
Lecture Notes in Computer Science
3509
, 2005, pp. 51-65
Hardness and approximation results for packing Steiner trees
Joseph Cheriyan
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
3221
, 2004, pp. 180-191
Frequency channel assignment on planar networks
Michael Molloy
,
Mohammad R. Salavatipour
Lecture Notes in Computer Science
2461
, 2002, pp. 736-747