Author of the publication

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

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem., , , , and . J. Comb. Optim., 1 (4): 413-426 (1998)Introduction., , , and . Annals OR, 129 (1-4): 17-19 (2004)Transitive Packing: A Unifying Concept in Combinatorial Optimization., and . SIAM Journal on Optimization, 13 (2): 335-367 (2002)Scheduling to Minimize Average Completion Time Revisited: Deterministic On-Line Algorithms., and . WAOA, volume 2909 of Lecture Notes in Computer Science, page 227-234. Springer, (2003)Stochastic Machine Scheduling: Performance Guarantees for LP-based Priority Policies., , and . RANDOM-APPROX, volume 1671 of Lecture Notes in Computer Science, page 144-155. Springer, (1999)Random-Based Scheduling: New Approximations and LP Lower Bounds., and . RANDOM, volume 1269 of Lecture Notes in Computer Science, page 119-133. Springer, (1997)A General Framework for Designing Approximation Schemes for Combinatorial Optimization Problems with Many Objectives Combined into One., and . APPROX-RANDOM, volume 5171 of Lecture Notes in Computer Science, page 179-192. Springer, (2008)On the Inefficiency of Equilibria in Congestion Games., , and . IPCO, volume 3509 of Lecture Notes in Computer Science, page 167-181. Springer, (2005)The Interval Order Polytope of a Digraph., and . IPCO, volume 920 of Lecture Notes in Computer Science, page 50-64. Springer, (1995)Improved Scheduling Algorithms for Minsum Criteria., , , , , and . ICALP, volume 1099 of Lecture Notes in Computer Science, page 646-657. Springer, (1996)