default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOla Svensson
Person information
- affiliation: Swiss Federal Institute of Technology in Lausanne, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c69]Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson:
Analyzing Dα seeding for k-means. ICML 2024- [c68]Joakim Blikstad
, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. SOSA 2024: 331-336 - [c67]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring Is (Nearly) as Easy as Offline. STOC 2024: 36-46 - [e3]Karl Bringmann, Martin Grohe, Gabriele Puppis, Ola Svensson:
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, July 8-12, 2024, Tallinn, Estonia. LIPIcs 297, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2024, ISBN 978-3-95977-322-5 [contents] - [i55]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Online Edge Coloring is (Nearly) as Easy as Offline. CoRR abs/2402.18339 (2024) - [i54]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Deterministic Online Bipartite Edge Coloring. CoRR abs/2408.03661 (2024) - [i53]Beatriz Borges, Negar Foroutan, Deniz Bayazit, Anna Sotnikova, Syrielle Montariol, Tanya Nazaretzky, Mohammadreza Banaei, Alireza Sakhaeirad, Philippe Servant, Seyed Parsa Neshaei, Jibril Frej, Angelika Romanou, Gail Weiss, Sepideh Mamooler, Zeming Chen, Simin Fan, Silin Gao, Mete Ismayilzada, Debjit Paul, Alexandre Schöpfer, Andrej Janchevski, Anja Tiede, Clarence Linden, Emanuele Troiani, Francesco Salvi, Freya Behrens, Giacomo Orsi, Giovanni Piccioli, Hadrien Sevel, Louis Coulon, Manuela Pineros-Rodriguez, Marin Bonnassies, Pierre Hellich, Puck van Gerwen, Sankalp Gambhir, Solal Pirelli, Thomas Blanchard, Timothée Callens, Toni Abi Aoun, Yannick Calvino Alonso, Yuri Cho, Alberto Silvio Chiappa, Antonio Sclocchi, Étienne Bruno, Florian Hofhammer, Gabriel Pescia, Geovani Rizk, Leello Dadi, Lucas Stoffl, Manoel Horta Ribeiro, Matthieu Bovel, Yueyang Pan, Aleksandra Radenovic, Alexandre Alahi, Alexander Mathis, Anne-Florence Bitbol, Boi Faltings, Cécile Hébert, Devis Tuia, François Maréchal, George Candea, Giuseppe Carleo, Jean-Cédric Chappelier, Nicolas Flammarion, Jean-Marie Fürbringer, Jean-Philippe Pellet, Karl Aberer, Lenka Zdeborová, Marcel Salathé, Martin Jaggi, Martin Rajman, Mathias Payer, Matthieu Wyart, Michael Gastpar, Michele Ceriotti, Ola Svensson, Olivier Lévêque, Paolo Ienne, Rachid Guerraoui, Robert West, Sanidhya Kashyap, Valerio Piazza, Viesturs Simanis, Viktor Kuncak, Volkan Cevher, Philippe Schwaller, Sacha Friedli, Patrick Jermann, Tanja Käser, Antoine Bosselut:
Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants. CoRR abs/2408.11841 (2024) - 2023
- [j35]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): 24:1-24:52 (2023) - [j34]Paritosh Garg, Linus Jordan, Ola Svensson:
Semi-streaming algorithms for submodular matroid intersection. Math. Program. 197(2): 967-990 (2023) - [c66]Marina Drygala, Sai Ganesh Nagarajan, Ola Svensson:
Online Algorithms with Costly Predictions. AISTATS 2023: 8078-8101 - [c65]Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan:
The Price of Explainability for Clustering. FOCS 2023: 1131-1148 - [c64]Silvio Lattanzi, Ola Svensson, Sergei Vassilvitskii:
Speeding Up Bellman Ford via Minimum Violation Permutations. ICML 2023: 18584-18598 - [c63]Xinrui Jia, Ola Svensson, Weiqiang Yuan:
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. SODA 2023: 1635-1654 - [i52]Anupam Gupta, Madhusudhan Reddy Pittu, Ola Svensson, Rachel Yuan:
The Price of Explainability for Clustering. CoRR abs/2304.09743 (2023) - [i51]Étienne Bamas, Sai Ganesh Nagarajan, Ola Svensson:
An Analysis of $D^α$ seeding for $k$-means. CoRR abs/2310.13474 (2023) - [i50]Joakim Blikstad, Ola Svensson, Radu Vintan, David Wajc:
Simple and Asymptotically Optimal Online Bipartite Edge Coloring. CoRR abs/2311.04574 (2023) - [i49]Nicole Megow, Benjamin Moseley, David B. Shmoys, Ola Svensson, Sergei Vassilvitskii, Jens Schlöter:
Scheduling (Dagstuhl Seminar 23061). Dagstuhl Reports 13(2): 1-19 (2023) - 2022
- [j33]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): 100567 (2022) - [j32]Xinrui Jia, Kshiteej Sheth, Ola Svensson:
Fair colorful k-center clustering. Math. Program. 192(1): 339-360 (2022) - [j31]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. SIAM J. Comput. 51(3): 766-819 (2022) - [c62]Buddhima Gamlath, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Approximate Cluster Recovery from Noisy Labels. COLT 2022: 1463-1509 - [c61]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. ESA 2022: 52:1-52:14 - [c60]Moran Feldman, Paul Liu, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization Under Matroid Constraints. ICALP 2022: 59:1-59:20 - [c59]Étienne Bamas, Marina Drygala, Ola Svensson:
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. IPCO 2022: 57-69 - [c58]Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson:
Towards Non-Uniform k-Center with Constant Types of Radii. SOSA 2022: 228-237 - [c57]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow time scheduling and prefix Beck-Fiala. STOC 2022: 331-342 - [i48]Nikhil Bansal, Lars Rohwedder, Ola Svensson:
Flow Time Scheduling and Prefix Beck-Fiala. CoRR abs/2202.02217 (2022) - [i47]Étienne Bamas, Marina Drygala, Ola Svensson:
A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem. CoRR abs/2202.07283 (2022) - [i46]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Submodular Maximization Subject to Matroid Intersection on the Fly. CoRR abs/2204.05154 (2022) - [i45]Xinrui Jia, Ola Svensson, Weiqiang Yuan:
The Exact Bipartite Matching Polytope Has Exponential Extension Complexity. CoRR abs/2211.09106 (2022) - 2021
- [j30]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes with Applications to Bayesian Selection Problems. SIAM J. Comput. 50(2): 255-300 (2021) - [j29]Nikhil Bansal, Aravind Srinivasan, Ola Svensson:
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. SIAM J. Comput. 50(3) (2021) - [c56]Paritosh Garg, Linus Jordan, Ola Svensson:
Semi-streaming Algorithms for Submodular Matroid Intersection. IPCO 2021: 208-222 - [c55]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Parallel and Efficient Hierarchical k-Median Clustering. NeurIPS 2021: 20333-20345 - [c54]Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson:
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. NeurIPS 2021: 28929-28939 - [c53]Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. SODA 2021: 2660-2678 - [i44]Paritosh Garg, Linus Jordan, Ola Svensson:
Semi-Streaming Algorithms for Submodular Matroid Intersection. CoRR abs/2102.04348 (2021) - [i43]Buddhima Gamlath, Xinrui Jia, Adam Polak, Ola Svensson:
Nearly-Tight and Oblivious Algorithms for Explainable Clustering. CoRR abs/2106.16147 (2021) - [i42]Friedrich Eisenbrand, Martina Gallato, Ola Svensson, Moritz Venzin:
A QPTAS for stabbing rectangles. CoRR abs/2107.06571 (2021) - [i41]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
Streaming Submodular Maximization with Matroid and Matching Constraints. CoRR abs/2107.07183 (2021) - [i40]Xinrui Jia, Lars Rohwedder, Kshiteej Sheth, Ola Svensson:
Towards Non-Uniform k-Center with Constant Types of Radii. CoRR abs/2110.02688 (2021) - 2020
- [j28]Ola Svensson, Jakub Tarnawski, László A. Végh:
A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. J. ACM 67(6): 37:1-37:53 (2020) - [j27]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) - [c52]Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson:
Robust Algorithms Under Adversarial Injections. ICALP 2020: 56:1-56:15 - [c51]Xinrui Jia, Kshiteej Sheth, Ola Svensson:
Fair Colorful k-Center Clustering. IPCO 2020: 209-222 - [c50]Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson:
Learning Augmented Energy Minimization via Speed Scaling. NeurIPS 2020 - [c49]Étienne Bamas, Andreas Maggiori, Ola Svensson:
The Primal-Dual method for Learning Augmented Algorithms. NeurIPS 2020 - [c48]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Fast and Accurate $k$-means++ via Rejection Sampling. NeurIPS 2020 - [c47]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: 1363-1374 - [i39]Moran Feldman, Ashkan Norouzi-Fard, Ola Svensson, Rico Zenklusen:
The One-way Communication Complexity of Submodular Maximization with Applications to Streaming and Robustness. CoRR abs/2003.13459 (2020) - [i38]Paritosh Garg, Sagar Kale, Lars Rohwedder, Ola Svensson:
Robust Algorithms under Adversarial Injections. CoRR abs/2004.12667 (2020) - [i37]Xinrui Jia, Kshiteej Sheth, Ola Svensson:
Fair Colorful k-Center Clustering. CoRR abs/2007.04059 (2020) - [i36]Étienne Bamas, Andreas Maggiori, Lars Rohwedder, Ola Svensson:
Learning Augmented Energy Minimization via Speed Scaling. CoRR abs/2010.11629 (2020) - [i35]Étienne Bamas, Andreas Maggiori, Ola Svensson:
The Primal-Dual method for Learning Augmented Algorithms. CoRR abs/2010.11632 (2020) - [i34]Hendrik Fichtenberger, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson:
Consistent k-Clustering for General Metrics. CoRR abs/2011.06888 (2020) - [i33]Vincent Cohen-Addad, Silvio Lattanzi, Ashkan Norouzi-Fard, Christian Sohler, Ola Svensson:
Fast and Accurate k-means++ via Rejection Sampling. CoRR abs/2012.11891 (2020) - [i32]Nicole Megow, David B. Shmoys, Ola Svensson:
Scheduling (Dagstuhl Seminar 20081). Dagstuhl Reports 10(2): 50-75 (2020)
2010 – 2019
- 2019
- [j26]Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ. Math. Oper. Res. 44(1): 147-172 (2019) - [c46]Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc:
Online Matching with General Arrivals. FOCS 2019: 26-37 - [c45]Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. FOCS 2019: 910-928 - [c44]Ola Svensson:
Approximately Good and Modern Matchings (Invited Talk). ICALP 2019: 3:1-3:1 - [c43]Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson:
Weighted Matchings via Unweighted Augmentations. PODC 2019: 491-500 - [c42]Buddhima Gamlath, Sagar Kale, Ola Svensson:
Beating Greedy for Stochastic Bipartite Matching. SODA 2019: 2841-2854 - [e2]Michael A. Bender, Ola Svensson, Grzegorz Herman:
27th Annual European Symposium on Algorithms, ESA 2019, September 9-11, 2019, Munich/Garching, Germany. LIPIcs 144, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-124-5 [contents] - [i31]Buddhima Gamlath, Michael Kapralov, Andreas Maggiori, Ola Svensson, David Wajc:
Online Matching with General Arrivals. CoRR abs/1904.08255 (2019) - [i30]Nikhil Bansal, Ola Svensson, Luca Trevisan:
New Notions and Constructions of Sparsification for Graphs and Hypergraphs. CoRR abs/1905.01495 (2019) - [i29]Buddhima Gamlath, Sagar Kale, Ola Svensson:
Beating Greedy for Stochastic Bipartite Matching. CoRR abs/1909.12760 (2019) - 2018
- [j25]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. Math. Oper. Res. 43(2): 638-650 (2018) - [j24]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant factor approximation for ATSP with two edge weights. Math. Program. 172(1-2): 371-397 (2018) - [j23]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. Theory Comput. 14(1): 1-29 (2018) - [j22]Teklemariam Tsegay Tesfay, Jean-Yves Le Boudec, Ola Svensson:
Optimal Software Patching Plan for PMUs. IEEE Trans. Smart Grid 9(6): 6500-6510 (2018) - [c41]Ola Svensson:
Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). FSTTCS 2018: 3:1-3:1 - [c40]Buddhima Gamlath, Sangxia Huang, Ola Svensson:
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. ICALP 2018: 57:1-57:14 - [c39]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: 3826-3835 - [c38]Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On Bounded Pitch Inequalities for the Min-Knapsack Polytope. ISCO 2018: 170-182 - [c37]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. SODA 2018: 735-752 - [c36]Ola Svensson, Jakub Tarnawski, László A. Végh:
A constant-factor approximation algorithm for the asymmetric traveling salesman problem. STOC 2018: 204-213 - [i28]Yuri Faenza, Igor Malinovic, Monaldo Mastrolilli, Ola Svensson:
On bounded pitch inequalities for the min-knapsack polytope. CoRR abs/1801.08850 (2018) - [i27]Buddhima Gamlath, Sangxia Huang, Ola Svensson:
Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering. CoRR abs/1803.00926 (2018) - [i26]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 abs/1808.01842 (2018) - [i25]Buddhima Gamlath, Sagar Kale, Slobodan Mitrovic, Ola Svensson:
Weighted Matchings via Unweighted Augmentations. CoRR abs/1811.02760 (2018) - 2017
- [j21]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. SIAM J. Comput. 46(1): 272-306 (2017) - [j20]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. ACM Trans. Algorithms 13(2): 21:1-21:20 (2017) - [j19]Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms 13(3): 37:1-37:28 (2017) - [c35]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. FOCS 2017: 61-72 - [c34]Ola Svensson, Jakub Tarnawski:
The Matching Problem in General Graphs Is in Quasi-NC. FOCS 2017: 696-707 - [c33]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. SODA 2017: 2326-2341 - [c32]Christos Kalaitzis, Ola Svensson, Jakub Tarnawski:
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. SODA 2017: 2654-2669 - [i24]Ola Svensson, Jakub Tarnawski:
The Matching Problem in General Graphs is in Quasi-NC. CoRR abs/1704.01929 (2017) - [i23]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Framework for the Secretary Problem on the Intersection of Matroids. CoRR abs/1704.02608 (2017) - [i22]Ola Svensson, Jakub Tarnawski, László A. Végh:
A Constant-Factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem. CoRR abs/1708.04215 (2017) - [i21]Ola Svensson, Jakub Tarnawski:
The Matching Problem in General Graphs is in Quasi-NC. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j18]Tobias Mömke, Ola Svensson:
Removing and Adding Edges for the Traveling Salesman Problem. J. ACM 63(1): 2:1-2:28 (2016) - [j17]Shi Li, Ola Svensson:
Approximating k-Median via Pseudo-Approximation. SIAM J. Comput. 45(2): 530-547 (2016) - [j16]Lukás Polácek, Ola Svensson:
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation. ACM Trans. Algorithms 12(2): 13:1-13:13 (2016) - [c31]Ola Svensson:
Algorithms with Provable Guarantees for Clustering. ESA 2016: 2:1-2:1 - [c30]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights - (Extended Abstract). IPCO 2016: 226-237 - [c29]Aditya Bhaskara, Mehrdad Ghadiri, Vahab S. Mirrokni, Ola Svensson:
Linear Relaxations for Finding Diverse Elements in Metric Spaces. NIPS 2016: 4098-4106 - [c28]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes. SODA 2016: 1014-1033 - [c27]Nikhil Bansal, Aravind Srinivasan, Ola Svensson:
Lift-and-round to improve weighted completion time on unrelated machines. STOC 2016: 156-167 - [i20]Christos Kalaitzis, Ola Svensson, Jakub Tarnawski:
Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios. CoRR abs/1607.07631 (2016) - [i19]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. CoRR abs/1609.03737 (2016) - [i18]Sara Ahmadian, Ashkan Norouzi-Fard, Ola Svensson, Justin Ward:
Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms. CoRR abs/1612.07925 (2016) - 2015
- [j15]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of trees for capacitated k-center. Math. Program. 154(1-2): 29-53 (2015) - [j14]José Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Víctor Verdugo, José Verschae:
Strong LP formulations for scheduling splittable jobs on unrelated machines. Math. Program. 154(1-2): 305-328 (2015) - [j13]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): 427-462 (2015) - [j12]Sofya Raskhodnikova, Ola Svensson:
Special Issue: APPROX-RANDOM 2013: Guest Editors' Foreword. Theory Comput. 11: 237-239 (2015) - [c26]Ola Svensson:
Approximating ATSP by Relaxing Connectivity. FOCS 2015: 1-19 - [c25]Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. FOCS 2015: 1123-1142 - [c24]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. SODA 2015: 708-721 - [c23]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. SODA 2015: 1189-1201 - [c22]Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. SODA 2015: 1357-1372 - [e1]Evripidis Bampis, Ola Svensson:
Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8952, Springer 2015, ISBN 978-3-319-18262-9 [contents] - [i17]Ola Svensson:
Approximating ATSP by Relaxing Connectivity. CoRR abs/1502.02051 (2015) - [i16]Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover within a Factor 2-ε. CoRR abs/1503.00753 (2015) - [i15]Moran Feldman, Ola Svensson, Rico Zenklusen:
Online Contention Resolution Schemes. CoRR abs/1508.00142 (2015) - [i14]Ola Svensson, Jakub Tarnawski, László A. Végh:
Constant Factor Approximation for ATSP with Two Edge Weights. CoRR abs/1511.07038 (2015) - [i13]Nikhil Bansal, Ola Svensson, Aravind Srinivasan:
Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines. CoRR abs/1511.07826 (2015) - 2014
- [c21]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. FOCS 2014: 256-265 - [c20]Hyung-Chan An, Aditya Bhaskara, Chandra Chekuri, Shalmoli Gupta, Vivek Madan, Ola Svensson:
Centrality of Trees for Capacitated k-Center. IPCO 2014: 52-63 - [c19]José R. Correa, Alberto Marchetti-Spaccamela, Jannik Matuschke, Leen Stougie, Ola Svensson, Victor Verdugo, José Verschae:
Strong LP Formulations for Scheduling Splittable Jobs on Unrelated Machines. IPCO 2014: 249-260 - [c18]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. IPCO 2014: 333-344 - [i12]Christos Kalaitzis, Aleksander Madry, Alantha Newman, Lukas Polacek, Ola Svensson:
On the Configuration LP for Maximum Budgeted Allocation. CoRR abs/1403.7519 (2014) - [i11]Moran Feldman, Ola Svensson, Rico Zenklusen:
A Simple Order-Oblivious O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem. CoRR abs/1404.4473 (2014) - [i10]Hyung-Chan An, Mohit Singh, Ola Svensson:
LP-Based Algorithms for Capacitated Facility Location. CoRR abs/1407.3263 (2014) - [i9]Chidambaram Annamalai, Christos Kalaitzis, Ola Svensson:
Combinatorial Algorithm for Restricted Max-Min Fair Allocation. CoRR abs/1409.0607 (2014) - [i8]Hyung-Chan An, Ashkan Norouzi-Fard, Ola Svensson:
Dynamic Facility Location via Exponential Clocks. CoRR abs/1411.4476 (2014) - 2013
- [j11]Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Single machine scheduling with scenarios. Theor. Comput. Sci. 477: 57-66 (2013) - [j10]Ola Svensson:
Hardness of Vertex Deletion and Project Scheduling. Theory Comput. 9: 759-781 (2013) - [c17]Shi Li, Ola Svensson:
Approximating k-median via pseudo-approximation. STOC 2013: 901-910 - [c16]Ola Svensson:
Overview of New Approaches for Approximating TSP. WG 2013: 5-11 - [i7]Hyung-Chan An, Aditya Bhaskara, Ola Svensson:
Centrality of Trees for Capacitated k-Center. CoRR abs/1304.2983 (2013) - 2012
- [j9]Ola Svensson:
Santa Claus Schedules Jobs on Unrelated Machines. SIAM J. Comput. 41(5): 1318-1341 (2012) - [j8]Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Tight approximation algorithms for scheduling with fixed jobs and nonavailability. ACM Trans. Algorithms 8(3): 27:1-27:15 (2012) - [j7]Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. ACM Trans. Comput. Theory 4(1): 2:1-2:31 (2012) - [c15]Ola Svensson:
Hardness of Vertex Deletion and Project Scheduling. APPROX-RANDOM 2012: 301-312 - [c14]Lukas Polacek, Ola Svensson:
Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation. ICALP (1) 2012: 726-737 - [i6]Lukas Polacek, Ola Svensson:
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation. CoRR abs/1205.1373 (2012) - [i5]Ola Svensson:
Hardness of Vertex Deletion and Project Scheduling. CoRR abs/1206.3408 (2012) - [i4]Shi Li, Ola Svensson:
Approximating $k$-Median via Pseudo-Approximation. CoRR abs/1211.0243 (2012) - 2011
- [j6]Monaldo Mastrolilli, Ola Svensson:
Hardness of Approximating Flow and Job Shop Scheduling Problems. J. ACM 58(5): 20:1-20:32 (2011) - [j5]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
On the Approximability of Single-Machine Scheduling with Precedence Constraints. Math. Oper. Res. 36(4): 653-669 (2011) - [j4]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. SIAM J. Comput. 40(2): 567-596 (2011) - [j3]Ola Svensson:
Hardness of Precedence Constrained Scheduling on Identical Machines. SIAM J. Comput. 40(5): 1258-1274 (2011) - [c13]Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson:
Faster Approximation Algorithms for Scheduling with Fixed Jobs. CATS 2011: 3-10 - [c12]Tobias Mömke, Ola Svensson:
Approximating Graphic TSP by Matchings. FOCS 2011: 560-569 - [c11]Ola Svensson:
Santa Claus schedules jobs on unrelated machines. STOC 2011: 617-626 - [i3]Tobias Mömke, Ola Svensson:
Approximating Graphic TSP by Matchings. CoRR abs/1104.3090 (2011) - 2010
- [j2]Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan:
Minimizing the sum of weighted completion times in a concurrent open shop. Oper. Res. Lett. 38(5): 390-395 (2010) - [c10]Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. APPROX-RANDOM 2010: 110-123 - [c9]Ola Svensson:
Conditional hardness of precedence constrained scheduling on identical machines. STOC 2010: 745-754 - [i2]Ola Svensson:
Santa Claus Schedules Jobs on Unrelated Machines. CoRR abs/1011.1168 (2010) - [i1]Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson:
Approximating Linear Threshold Predicates. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c8]Monaldo Mastrolilli, Ola Svensson:
Improved Bounds for Flow Shop Scheduling. ICALP (1) 2009: 677-688 - 2008
- [j1]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders. Bull. EATCS 95: 37-58 (2008) - [c7]Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Approximating Single Machine Scheduling with Scenarios. APPROX-RANDOM 2008: 153-164 - [c6]Monaldo Mastrolilli, Ola Svensson:
(Acyclic) JobShops are Hard to Approximate. FOCS 2008: 583-592 - 2007
- [c5]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. FOCS 2007: 329-337 - [c4]Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
Scheduling with Precedence Constraints of Low Fractional Dimension. IPCO 2007: 130-144 - 2006
- [c3]Ola Svensson, Sergei G. Vorobyov:
Linear Programming Polytope and Algorithm for Mean Payoff Games. AAIM 2006: 64-78 - [c2]Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson:
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. APPROX-RANDOM 2006: 15-26 - [c1]Ola Svensson, Sergei G. Vorobyov:
Linear Complementarity and P-Matrices for Stochastic Games. Ershov Memorial Conference 2006: 409-423
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
