Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Vector assignment problems: a general framework
Journal of Algorithms
Approximation schemes for scheduling and covering on unrelated machines
Theoretical Computer Science
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Theoretical Computer Science
Maximizing the minimum load for selfish agents
Theoretical Computer Science
Maximizing the minimum load for selfish agents
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
A truthful constant approximation for maximizing the minimum load on related machines
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Truthful Approximation Schemes for Single-Parameter Agents
SIAM Journal on Computing
A note on semi-online machine covering
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
| Hi-index | 0.00 |