Ola Svensson
Ola Svensson
Verified email at epfl.ch
Title
Cited by
Cited by
Year
Approximating -Median via Pseudo-Approximation
S Li, O Svensson
SIAM Journal on Computing 45 (2), 530-547, 2016
2082016
Better Guarantees for -Means and Euclidean -Median by Primal-Dual Algorithms
S Ahmadian, A Norouzi-Fard, O Svensson, J Ward
SIAM Journal on Computing, FOCS17-97-FOCS17-156, 2019
1212019
Approximating graphic TSP by matchings
T Mömke, O Svensson
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, 560-569, 2011
1152011
Santa claus schedules jobs on unrelated machines
O Svensson
SIAM Journal on Computing 41 (5), 1318-1341, 2012
962012
LP-based algorithms for capacitated facility location
HC An, M Singh, O Svensson
SIAM Journal on Computing 46 (1), 272-306, 2017
902017
Inapproximability results for sparsest cut, optimal linear arrangement, and precedence constrained scheduling
C Ambuhl, M Mastrolilli, O Svensson
48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), 329-337, 2007
842007
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem
M Feldman, O Svensson, R Zenklusen
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
782014
Minimizing the sum of weighted completion times in a concurrent open shop
M Mastrolilli, M Queyranne, AS Schulz, O Svensson, NA Uhan
Operations Research Letters 38 (5), 390-395, 2010
702010
Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut
C Ambühl, M Mastrolilli, O Svensson
SIAM Journal on Computing 40 (2), 567-596, 2011
672011
Centrality of trees for capacitated $$$$-center
HC An, A Bhaskara, C Chekuri, S Gupta, V Madan, O Svensson
Mathematical Programming 154 (1-2), 29-53, 2015
612015
Hardness of precedence constrained scheduling on identical machines
O Svensson
SIAM Journal on Computing 40 (5), 1258-1274, 2011
60*2011
Online contention resolution schemes
M Feldman, O Svensson, R Zenklusen
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
522016
Combinatorial algorithm for restricted max-min fair allocation
C Annamalai, C Kalaitzis, O Svensson
ACM Transactions on Algorithms (TALG) 13 (3), 1-28, 2017
402017
The matching problem in general graphs is in quasi-NC
O Svensson, J Tarnawski
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
332017
On the approximability of single-machine scheduling with precedence constraints
C Ambühl, M Mastrolilli, N Mutsanas, O Svensson
Mathematics of Operations Research 36 (4), 653-669, 2011
312011
Beyond -approximation for submodular maximization on massive data streams
A Norouzi-Fard, J Tarnawski, S Mitrović, A Zandieh, A Mousavifar, ...
arXiv preprint arXiv:1808.01842, 2018
302018
Removing and adding edges for the traveling salesman problem
T Mömke, O Svensson
Journal of the ACM (JACM) 63 (1), 1-28, 2016
302016
Quasi-polynomial local search for restricted max-min fair allocation
L Poláček, O Svensson
ACM Transactions on Algorithms (TALG) 12 (2), 1-13, 2015
302015
Lift-and-round to improve weighted completion time on unrelated machines
N Bansal, A Srinivasan, O Svensson
SIAM Journal on Computing, STOC16-138-STOC16-159, 2019
292019
A constant-factor approximation algorithm for the asymmetric traveling salesman problem
O Svensson, J Tarnawski, LA Végh
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
292018
The system can't perform the operation now. Try again later.
Articles 1–20