Ola Svensson

I am an Assistant Professor active in the theory group at the School of Computer
and Communication Sciences,
EPFL.
My research interests
include approximation algorithms, combinatorial optimization,
computational complexity and scheduling. I am grateful to the generous support from the ERC Starting
Grant "OptApprox" (2014-2019).

Moran Feldman, Ola Svensson, and Rico Zenklusen: A Simple O(loglog(rank))-Competitive Algorithm for the Matroid Secretary Problem
To appear in ACM-SIAM Symposium on Discrete Algorithms (SODA), 2015.
A preliminary version available as arXiv report 1404.4473

Hyung-Chan An, Mohit Singh, and Ola Svensson: LP-Based Algorithms for Capacitated Facility Location
To appear in the 55th Annual Symposium on Foundations of Computer Science (FOCS), 2014. Invited to
SICOMP special issue.
A preliminary version available as arXiv report 1407.3263

Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, and Ola
Svensson: Centrality of Trees for Capacitated k-Center.
To appear in the 17th Conference on Integer Programming and Combinatorial Optimization
(IPCO), 2014. Merged paper based on papers by the 1st, 2nd, 6th authors and by the 3rd, 4th, 5th
authors.
A preliminary version available as arXiv report 1304.2983

Shi Li, Ola Svensson: Approximating k-median via Pseudo-Approximation. Extended abstract in the 45th
ACM Symposium on the Theory of Computing (STOC), 2013. Invited to
SICOMP special issue.
Full version available as arXiv report 1211.0243

Ola Svensson: Hardness of Vertex Deletion and Project Scheduling . Extended abstract in APPROX
2012. Invited to ToC special issue
Full version available as arXiv report 1206.3408.