Ola Svensson

ORCID

Publication Activity (10 Years)

Years Active: 2006-2024
Publications (10 Years): 98

Top Venues

Publications

Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Online Edge Coloring is (Nearly) as Easy as Offline. CoRR (2024)
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Online Edge Coloring Is (Nearly) as Easy as Offline. STOC (2024)
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA (2024)
Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
The Price of Explainability for Clustering. FOCS (2023)
Xinrui Jia, Ola Svensson, Weiqiang Yuan
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. SODA (2023)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
The One-Way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. J. ACM 70 (4) (2023)
Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR (2023)
Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
An Analysis of $D^α$ seeding for $k$-means. CoRR (2023)
Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan
The Price of Explainability for Clustering. CoRR (2023)
Paritosh Garg, Linus Jordan, Ola Svensson
Semi-streaming algorithms for submodular matroid intersection. Math. Program. 197 (2) (2023)
Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii
Speeding Up Bellman Ford via Minimum Violation Permutations. ICML (2023)
Marina Drygala, Sai Ganesh Nagarajan, Ola Svensson
Online Algorithms with Costly Predictions. AISTATS (2023)
Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter
Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports 13 (2) (2023)
Étienne Bamas, Marina Drygala, Ola Svensson
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. CoRR (2022)
Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
-Center with Constant Types of Radii. SOSA (2022)
Daniel Bienstock, Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson, Mark Zuckerberg
On inequalities with bounded coefficients and pitch for the min knapsack polytope. Discret. Optim. 44 (Part) (2022)
Nikhil Bansal, Lars Rohwedder, Ola Svensson
Flow time scheduling and prefix Beck-Fiala. STOC (2022)
Xinrui Jia, Kshiteej Sheth, Ola Svensson
Fair colorful k-center clustering. Math. Program. 192 (1) (2022)
Nikhil Bansal, Lars Rohwedder, Ola Svensson
Flow Time Scheduling and Prefix Beck-Fiala. CoRR (2022)
Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
Approximate Cluster Recovery from Noisy Labels. COLT (2022)
Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Streaming Submodular Maximization Under Matroid Constraints. ICALP (2022)
Xinrui Jia, Ola Svensson, Weiqiang Yuan
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. CoRR (2022)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR (2022)
Étienne Bamas, Marina Drygala, Ola Svensson
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. IPCO (2022)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Submodular Maximization Subject to Matroid Intersection on the Fly. ESA (2022)
Moran Feldman, Ola Svensson, Rico Zenklusen
A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. 51 (3) (2022)
Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson
Towards Non-Uniform k-Center with Constant Types of Radii. CoRR (2021)
Paritosh Garg, Linus Jordan, Ola Svensson
Semi-streaming Algorithms for Submodular Matroid Intersection. IPCO (2021)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR (2021)
Nikhil Bansal, Aravind Srinivasan, Ola Svensson
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. 50 (3) (2021)
Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin
A QPTAS for stabbing rectangles. CoRR (2021)
Moran Feldman, Ola Svensson, Rico Zenklusen
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. 50 (2) (2021)
Paritosh Garg, Linus Jordan, Ola Svensson
Semi-Streaming Algorithms for Submodular Matroid Intersection. CoRR (2021)
Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. NeurIPS (2021)
Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. CoRR (2021)
Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
Consistent k-Clustering for General Metrics. SODA (2021)
Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson
Parallel and Efficient Hierarchical k-Median Clustering. NeurIPS (2021)
Étienne Bamas, Andreas Maggiori, Ola Svensson
The Primal-Dual method for Learning Augmented Algorithms. CoRR (2020)
Ola Svensson, Jakub Tarnawski, László A. Végh
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM 67 (6) (2020)
Xinrui Jia, Kshiteej Sheth, Ola Svensson
Fair Colorful k-Center Clustering. CoRR (2020)
Xinrui Jia, Kshiteej Sheth, Ola Svensson
Fair Colorful k-Center Clustering. IPCO (2020)
Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson
Fast and Accurate $k$-means++ via Rejection Sampling. NeurIPS (2020)
Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
Robust Algorithms Under Adversarial Injections. ICALP (2020)
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. SIAM J. Comput. 49 (4) (2020)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
The one-way communication complexity of submodular maximization with applications to streaming and robustness. STOC (2020)
Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR (2020)
Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson
Consistent k-Clustering for General Metrics. CoRR (2020)
Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson
Fast and Accurate k-means++ via Rejection Sampling. CoRR (2020)
Étienne Bamas, Andreas Maggiori, Ola Svensson
The Primal-Dual method for Learning Augmented Algorithms. NeurIPS (2020)
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
Learning Augmented Energy Minimization via Speed Scaling. NeurIPS (2020)
Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson
Robust Algorithms under Adversarial Injections. CoRR (2020)
Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson
Learning Augmented Energy Minimization via Speed Scaling. CoRR (2020)
Nicole Megow, David B. Shmoys, Ola Svensson
Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports 10 (2) (2020)
Buddhima Gamlath, Sagar Kale, Ola Svensson
Beating Greedy for Stochastic Bipartite Matching. CoRR (2019)
Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc
Online Matching with General Arrivals. CoRR (2019)
Nikhil Bansal, Ola Svensson, Luca Trevisan
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. CoRR (2019)
Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc
Online Matching with General Arrivals. FOCS (2019)
Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson
. Math. Oper. Res. 44 (1) (2019)
Nikhil Bansal, Ola Svensson, Luca Trevisan
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. FOCS (2019)
Buddhima Gamlath, Sagar Kale, Ola Svensson
Beating Greedy for Stochastic Bipartite Matching. SODA (2019)
Ola Svensson
Approximately Good and Modern Matchings (Invited Talk). ICALP (2019)
Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson
Weighted Matchings via Unweighted Augmentations. PODC (2019)
Ola Svensson, Jakub Tarnawski, László A. Végh
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC (2018)
Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aidasadat Mousavifar, Ola Svensson
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. ICML (2018)
Ashkan Norouzi-Fard, Jakub Tarnawski, Slobodan Mitrovic, Amir Zandieh, Aida Mousavifar, Ola Svensson
Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams. CoRR (2018)
Moran Feldman, Ola Svensson, Rico Zenklusen
(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. Math. Oper. Res. 43 (2) (2018)
Buddhima Gamlath, Sangxia Huang, Ola Svensson
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. ICALP (2018)
Ola Svensson
Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). FSTTCS (2018)
Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
On bounded pitch inequalities for the min-knapsack polytope. CoRR (2018)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant factor approximation for ATSP with two edge weights. Math. Program. 172 (1-2) (2018)
Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson
Weighted Matchings via Unweighted Augmentations. CoRR (2018)
Buddhima Gamlath, Sangxia Huang, Ola Svensson
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. CoRR (2018)
Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO (2018)
Moran Feldman, Ola Svensson, Rico Zenklusen
A Framework for the Secretary Problem on the Intersection of Matroids. SODA (2018)
Teklemariam Tsegay Tesfay, Jean-Yves Le Boudec, Ola Svensson
Optimal Software Patching Plan for PMUs. IEEE Trans. Smart Grid 9 (6) (2018)
Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. Theory Comput. 14 (1) (2018)
Ola Svensson, Jakub Tarnawski, László A. Végh
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR (2017)
Ola Svensson, Jakub Tarnawski
The Matching Problem in General Graphs is in Quasi-NC. CoRR (2017)
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. FOCS (2017)
Ola Svensson, Jakub Tarnawski
The Matching Problem in General Graphs is in Quasi-NC. Electron. Colloquium Comput. Complex. 24 (2017)
Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms 13 (3) (2017)
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. SODA (2017)
Moran Feldman, Ola Svensson, Rico Zenklusen
A Framework for the Secretary Problem on the Intersection of Matroids. CoRR (2017)
Hyung-Chan An, Mohit Singh, Ola Svensson
LP-Based Algorithms for Capacitated Facility Location. SIAM J. Comput. 46 (1) (2017)
Ola Svensson, Jakub Tarnawski
The Matching Problem in General Graphs Is in Quasi-NC. FOCS (2017)
Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson
Dynamic Facility Location via Exponential Clocks. ACM Trans. Algorithms 13 (2) (2017)
Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. SODA (2017)
Christos Kalaitzis, Ola Svensson, Jakub Tarnawski
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. CoRR (2016)
Nikhil Bansal, Aravind Srinivasan, Ola Svensson
Lift-and-round to improve weighted completion time on unrelated machines. STOC (2016)
Ola Svensson, Jakub Tarnawski, László A. Végh
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO (2016)
Lukás Polácek, Ola Svensson
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms 12 (2) (2016)
Tobias Mömke, Ola Svensson
Removing and Adding Edges for the Traveling Salesman Problem. J. ACM 63 (1) (2016)
Moran Feldman, Ola Svensson, Rico Zenklusen
Online Contention Resolution Schemes. SODA (2016)
Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. CoRR (2016)
Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson
Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS (2016)
Ola Svensson
Algorithms with Provable Guarantees for Clustering. ESA (2016)
Shi Li, Ola Svensson
Approximating k-Median via Pseudo-Approximation. SIAM J. Comput. 45 (2) (2016)
Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. CoRR (2016)
Ola Svensson
Approximating ATSP by Relaxing Connectivity. CoRR (2015)
Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukás Polácek, Ola Svensson
On the configuration LP for maximum budgeted allocation. Math. Program. 154 (1-2) (2015)

Ola Svensson.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Ola Svensson