Author of the publication

Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine.

, , and . STOC, page 418-426. ACM, (1996)

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 Stock Size Problem., , , and . Operations Research, 46 (3-Supplement-3): S1-S12 (1998)The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices., and . J. Comb. Optim., 3 (1): 51-58 (1999)The multi-stripe travelling salesman problem., , and . CoRR, (2016)Dynamic and Kinetic Conflict-Free Coloring of Intervals with Respect to Points., , , , , and . CoRR, (2017)When Does a Dynamic Programming Formulation Guarantee the Existence of an FPTAS?. SODA, page 820-829. ACM/SIAM, (1999)Nothing New about Equiangular Polygons.. The American Mathematical Monthly, 120 (9): 849-850 (2013)An Algorithmic Analysis of the Honey-Bee Game., and . FUN, volume 6099 of Lecture Notes in Computer Science, page 178-189. Springer, (2010)How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?, , , , and . WINE, volume 5385 of Lecture Notes in Computer Science, page 82-93. Springer, (2008)Getting the Best Response for Your Erg., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 14-25. Springer, (2004)