Approximation schemes for scheduling
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Ancient and new algorithms for load balancing in the Lp norm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Designing PTASs for MIN-SUM Scheduling Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
Theoretical Computer Science
Load balancing of temporary tasks in the lp norm
Theoretical Computer Science - Approximation and online algorithms
A new model for selfish routing
Theoretical Computer Science
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
A tight upper bound for the k-partition problem on ideal sets
Operations Research Letters
Extending Graham's result on scheduling to other heuristics
Operations Research Letters
| Hi-index | 0.89 |