( en | de | ru )

 

Disambiguation of "Svensson, Ola"

Author of the publication

copydeleteadd this publication to your clipboard
A Framework for the Secretary Problem on the Intersection of Matroids.

, , and . CoRR, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Vladislava Ola

Axel Svensson

Uwe Svensson

Ola Ajaj

Ola Agevall

 

Other publications of authors with the same name

A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , and . Math. Oper. Res., 43 (2): 638-650 (2018)Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios., , and . CoRR, (2016)Combinatorial Algorithm for Restricted Max-Min Fair Allocation., , and . ACM Trans. Algorithms, 13 (3): 37:1-37:28 (2017)Santa Claus schedules jobs on unrelated machines.. STOC, page 617-626. ACM, (2011)Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 726-737. Springer, (2012)Centrality of Trees for Capacitated k-Center., , , , , and . IPCO, volume 8494 of Lecture Notes in Computer Science, page 52-63. Springer, (2014)Algorithms with Provable Guarantees for Clustering.. ESA, volume 57 of LIPIcs, page 2:1-2:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Lift-and-Round to Improve Weighted Completion Time on Unrelated Machines., , and . SIAM J. Comput., (2021)A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem., , and . IPCO, volume 13265 of Lecture Notes in Computer Science, page 57-69. Springer, (2022)The Exact Bipartite Matching Polytope Has Exponential Extension Complexity., , and . SODA, page 1635-1654. SIAM, (2023)