From post

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.

 

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

Local search for multiprocessor scheduling: how many moves does it take to a local optimum?, и . Oper. Res. Lett., 31 (2): 137-141 (2003)Average Case and Smoothed Competitive Analysis of the Multi-Level Feedback Algorithm, , , , и . Algorithms for Optimization with Incomplete Information, том 05031 из Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany IBFI, Schloss Dagstuhl, Germany, (2005)Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds., , , и . Algorithmica, 76 (4): 1077-1096 (2016)Posted Price Mechanisms for a Random Stream of Customers., , , , и . EC, стр. 169-186. ACM, (2017)Additive Approximation Schemes for Load Balancing Problems., , , и . ICALP, том 198 из LIPIcs, стр. 42:1-42:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Optimal bundle pricing for homogeneous items., , , , и . CTW, стр. 57-60. University of Twente, (2007)Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm, , , , и . Math. Oper. Res., 31 (1): 85-108 (2006)Stochastic Online Scheduling on Parallel Machines., , и . WAOA, том 3351 из Lecture Notes in Computer Science, стр. 167-180. Springer, (2004)Approximation in Preemptive Stochastic Online Scheduling., и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 516-527. Springer, (2006)Probabilistic Analysis of Online Bin Coloring Algorithms Via Stochastic Comparison., и . ESA, том 5193 из Lecture Notes in Computer Science, стр. 528-539. Springer, (2008)