Author of the publication

Improved Bounds on Relaxations of a Parallel Machine Scheduling Problem.

, , , , and . J. Comb. Optim., 1 (4): 413-426 (1998)

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

On the Relationship Between Combinatorial and LP-Based Approaches to NP-Hard Scheduling Problems., and . IPCO, volume 1412 of Lecture Notes in Computer Science, page 394-408. Springer, (1998)An Experimental Study of LP-Based Approximation Algorithms for Scheduling Problems., , and . SODA, page 453-462. ACM/SIAM, (1998)Off-line admission control for general scheduling problems., , and . SODA, page 879-888. ACM/SIAM, (2000)Scheduling to Minimize Average Completion Time: Off-line and On-line Algorithms., , and . SODA, page 142-151. ACM/SIAM, (1996)A 1.47-approximation algorithm for a preemptive single-machine scheduling problem., , and . Oper. Res. Lett., 26 (4): 149-154 (2000)ACMS: The Akamai Configuration Management System., , , and . NSDI, USENIX, (2005)I want to go home: Empowering the lost mobile device., , and . WiMob, page 64-70. IEEE Computer Society, (2010)Las Vegas RNC Algorithms for Unary Weighted Perfect Matching and T-Join Problems.. Inf. Process. Lett., 40 (3): 161-167 (1991)Highly efficient techniques for network forensics., , , and . ACM Conference on Computer and Communications Security, page 150-160. ACM, (2007)Distributed Job Scheduling in Rings., , , and . J. Parallel Distrib. Comput., 45 (2): 122-133 (1997)