Approximating k-median via pseudo-approximation S Li, O Svensson
proceedings of the forty-fifth annual ACM symposium on theory of computing …, 2013
325 2013 Better Guarantees for S Ahmadian, A Norouzi-Fard, O Svensson, J Ward
SIAM Journal on Computing 49 (4), FOCS17-97-FOCS17-156, 2019
315 2019 LP-based algorithms for capacitated facility location HC An, M Singh, O Svensson
SIAM Journal on Computing 46 (1), 272-306, 2017
150 2017 Online contention resolution schemes M Feldman, O Svensson, R Zenklusen
Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete …, 2016
145 2016 The primal-dual method for learning augmented algorithms E Bamas, A Maggiori, O Svensson
Advances in Neural Information Processing Systems 33, 20083-20094, 2020
142 2020 A Simple O (log log(rank)) M Feldman, O Svensson, R Zenklusen
Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014
138 2014 Approximating graphic TSP by matchings T Mömke, O Svensson
2011 IEEE 52nd annual symposium on foundations of computer science, 560-569, 2011
138 2011 Santa claus schedules jobs on unrelated machines O Svensson
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
127 2011 A constant-factor approximation algorithm for the asymmetric traveling salesman problem O Svensson, J Tarnawski, LA Végh
Journal of the ACM (JACM) 67 (6), 1-53, 2020
109 2020 Beyond 1/2-approximation for submodular maximization on massive data streams A Norouzi-Fard, J Tarnawski, S Mitrovic, A Zandieh, A Mousavifar, ...
International Conference on Machine Learning, 3829-3838, 2018
107 2018 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
101 2010 Centrality of trees for capacitated HC An, A Bhaskara, C Chekuri, S Gupta, V Madan, O Svensson
Mathematical Programming 154 (1), 29-53, 2015
99 2015 Hardness of precedence constrained scheduling on identical machines O Svensson
SIAM Journal on Computing 40 (5), 1258-1274, 2011
96 * 2011 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
93 2007 Online matching with general arrivals B Gamlath, M Kapralov, A Maggiori, O Svensson, D Wajc
2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), 26-37, 2019
87 2019 Weighted matchings via unweighted augmentations B Gamlath, S Kale, S Mitrovic, O Svensson
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019
85 2019 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
85 2011 Learning augmented energy minimization via speed scaling É Bamas, A Maggiori, L Rohwedder, O Svensson
Advances in Neural Information Processing Systems 33, 15350-15359, 2020
74 2020 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
71 2017 Combinatorial algorithm for restricted max-min fair allocation C Annamalai, C Kalaitzis, O Svensson
ACM Transactions on Algorithms (TALG) 13 (3), 1-28, 2017
70 2017