Author of the publication

Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091).

, , , and . Dagstuhl Reports, 1 (2): 67-93 (2011)

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.

 

Other publications of authors with the same name

Real-Time k-bounded Preemptive Scheduling., , , and . ALENEX, page 127-137. SIAM, (2016)Throughput maximization of real-time scheduling with batching., , , , , and . ACM Trans. Algorithms, 5 (2): 18:1-18:17 (2009)An EPTAS for Budgeted Matching and Budgeted Matroid Intersection., , and . CoRR, (2023)Spatial Voting with Incomplete Voter Information., , , , and . AAAI, page 9790-9797. AAAI Press, (2024)Fast Distributed Approximation for Max-Cut., , and . ALGOSENSORS, volume 10718 of Lecture Notes in Computer Science, page 41-56. Springer, (2017)On Lagrangian Relaxation and Subset Selection Problems., and . WAOA, volume 5426 of Lecture Notes in Computer Science, page 160-173. Springer, (2008)An EPTAS for Budgeted Matroid Independent Set., , and . SOSA, page 69-83. SIAM, (2023)Fast Information Spreading in Graphs with Large Weak Conductance., and . SIAM J. Comput., 41 (6): 1451-1465 (2012)Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs., and . FCT, volume 4639 of Lecture Notes in Computer Science, page 482-493. Springer, (2007)Improved Approximation for Two-Dimensional Vector Multiple Knapsack., , and . ISAAC, volume 283 of LIPIcs, page 20:1-20:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)