Author of the publication

On the Approximability of Average Completion Time Scheduling under Precedence Constraints.

. ICALP, volume 2076 of Lecture Notes in Computer Science, page 887-897. Springer, (2001)

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

How to detect a counterfeit coin: Adaptive versus non-adaptive solutions., , and . Inf. Process. Lett., 86 (3): 137-141 (2003)The multi-stripe travelling salesman problem., , and . CoRR, (2016)When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?. SODA, page 820-829. ACM/SIAM, (1999)Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points., , , , , and . CoRR, (2017)An Algorithmic Analysis of the Honey-Bee Game., and . FUN, volume 6099 of Lecture Notes in Computer Science, page 178-189. Springer, (2010)Nothing New about Equiangular Polygons.. The American Mathematical Monthly, 120 (9): 849-850 (2013)More about Subcolorings., , , and . WG, volume 2573 of Lecture Notes in Computer Science, page 68-79. Springer, (2002)Competitive Odds and Ends., and . Online Algorithms, volume 1442 of Lecture Notes in Computer Science, page 385-394. Springer, (1996)The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices., and . J. Comb. Optim., 3 (1): 51-58 (1999)The Stock Size Problem., , , and . Operations Research, 46 (3-Supplement-3): S1-S12 (1998)