Author of the publication

Minimizing total busy time in parallel scheduling with application to optical networks.

, , , , , , and . Theor. Comput. Sci., 411 (40-42): 3553-3562 (2010)

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 Scheduling with a Budget., , and . Algorithmica, 47 (3): 343-364 (2007)Approximations for Monotone and Non-monotone Submodular Maximization with Knapsack Constraints, , and . CoRR, (2011)Parameterized approximation via fidelity preserving transformations., , , and . J. Comput. Syst. Sci., (2018)There is no EPTAS for two-dimensional knapsack., and . Inf. Process. Lett., 110 (16): 707-710 (2010)Corrigendum: Improved results for data migration and open shop scheduling., , , and . ACM Trans. Algorithms, 9 (4): 34:1-34:7 (2013)Minimizing Average Completion of Dedicated Tasks and Interval Graphs., , and . RANDOM-APPROX, volume 2129 of Lecture Notes in Computer Science, page 114-126. Springer, (2001)Online Selection of Intervals and t-Intervals., , and . SWAT, volume 6139 of Lecture Notes in Computer Science, page 383-394. Springer, (2010)Periodic scheduling with obligatory vacations., , and . Theor. Comput. Sci., 410 (47-49): 5112-5121 (2009)Approximation schemes for deal splitting and covering integer programs with multiplicity constraints., , , and . Theor. Comput. Sci., 412 (52): 7087-7098 (2011)Scheduling jobs with dwindling resource requirements in clouds., , and . INFOCOM, page 601-609. IEEE, (2014)