Author of the publication

New Bounds for Variable-Sized and Resource Augmented Online Bin Packing.

, , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 306-317. Springer, (2002)

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

Randomized Online Scheduling with Delivery Times.. J. Comb. Optim., 3 (4): 399-416 (1999)A guessing game and randomized online algorithms.. STOC, page 592-601. ACM, (2000)Randomized Algorithms for Metrical Task Systems., and . WADS, volume 955 of Lecture Notes in Computer Science, page 159-170. Springer, (1995)A General Decomposition Theorem for the k-Server Problem.. ESA, volume 2161 of Lecture Notes in Computer Science, page 86-97. Springer, (2001)Linear Time Approximation Schemes for Vehicle Scheduling., and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 30-39. Springer, (2002)Scheduling Two Machines with Release Times., and . IPCO, volume 1610 of Lecture Notes in Computer Science, page 391-399. Springer, (1999)Randomized online interval scheduling.. Oper. Res. Lett., 22 (4-5): 171-177 (1998)A Bounded-Space Tree Traversal Algorithm., and . Inf. Process. Lett., 47 (4): 215-219 (1993)Randomized Algorithms for that Ancient Scheduling Problem.. WADS, volume 1272 of Lecture Notes in Computer Science, page 210-223. Springer, (1997)On the Online Bin Packing Problem.. ICALP, volume 2076 of Lecture Notes in Computer Science, page 237-248. Springer, (2001)