( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Hardness of Vertex Deletion and Project Scheduling.

. Theory of Computing, (2013)

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.

Vladislava Ola

Axel Svensson

Uwe Svensson

Ola Ajaj

Ola Redell

 

Другие публикации лиц с тем же именем

Hardness of Precedence Constrained Scheduling on Identical Machines.. SIAM J. Comput., 40 (5): 1258-1274 (2011)Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios., , и . CoRR, (2016)A Simple O(log log(rank))-Competitive Algorithm for the Matroid Secretary Problem., , и . Math. Oper. Res., 43 (2): 638-650 (2018)Algorithms with Provable Guarantees for Clustering.. ESA, том 57 из LIPIcs, стр. 2:1-2:1. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Strong LP formulations for scheduling splittable jobs on unrelated machines., , , , , , и . Math. Program., 154 (1-2): 305-328 (2015)On inequalities with bounded coefficients and pitch for the min knapsack polytope., , , , , и . Discret. Optim., 44 (Part): 100567 (2022)Santa Claus schedules jobs on unrelated machines.. STOC, стр. 617-626. ACM, (2011)Combinatorial Algorithm for Restricted Max-Min Fair Allocation., , и . ACM Trans. Algorithms, 13 (3): 37:1-37:28 (2017)Approximating Linear Threshold Predicates., , , и . TOCT, 4 (1): 2:1-2:31 (2012)Centrality of Trees for Capacitated k-Center., , , , , и . IPCO, том 8494 из Lecture Notes in Computer Science, стр. 52-63. Springer, (2014)