( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximation in Preemptive Stochastic Online Scheduling.

, и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 516-527. Springer, (2006)

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.

Nicole Megow

Heinrich Megow

Jörg Megow

Wolf-Rüdiger Megow

Dirk Megow

 

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

Stochastic Online Scheduling on Parallel Machines., , и . WAOA, том 3351 из Lecture Notes in Computer Science, стр. 167-180. Springer, (2004)Optimally handling commitment issues in online throughput maximization., , и . CoRR, (2019)A general framework for handling commitment in online throughput maximization., , , , и . Math. Program., 183 (1): 215-247 (2020)A Universal Error Measure for Input Predictions Applied to Online Graph Problems., , , , , и . NeurIPS, (2022)New Results on Online Resource Minimization., , и . CoRR, (2014)Online Graph Exploration: New Results on Old and New Algorithms., , и . ICALP (2), том 6756 из Lecture Notes in Computer Science, стр. 478-489. Springer, (2011)Approximation in Preemptive Stochastic Online Scheduling., и . ESA, том 4168 из Lecture Notes in Computer Science, стр. 516-527. Springer, (2006)Online Minimum Cost Matching with Recourse on the Line., и . APPROX-RANDOM, том 176 из LIPIcs, стр. 37:1-37:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Optimally Handling Commitment Issues in Online Throughput Maximization., , и . ESA, том 173 из LIPIcs, стр. 41:1-41:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Algorithms and complexity for periodic real-time scheduling., , , и . ACM Trans. Algorithms, 9 (1): 6:1-6:19 (2012)