( en | de | ru )

 

Disambiguation of "Svensson, Ola"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Bounds for Flow Shop Scheduling.

, and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 677-688. Springer, (2009)

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

Uwe Svensson

Axel Svensson

Ola Ajaj

Ola Agevall

 

Other publications of authors with the same name

Algorithms with Provable Guarantees for Clustering.. ESA, volume 57 of LIPIcs, page 2:1-2:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios., , and . CoRR, (2016)A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , and . Math. Oper. Res., 43 (2): 638-650 (2018)Approximating Linear Threshold Predicates., , , and . TOCT, 4 (1): 2:1-2:31 (2012)Hardness of Vertex Deletion and Project Scheduling.. Theory of Computing, (2013)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)Hardness of Precedence Constrained Scheduling on Identical Machines.. SIAM J. Comput., 40 (5): 1258-1274 (2011)