Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Information and Computation
Tight bounds for bandwidth allocation on two links
Discrete Applied Mathematics
Optimal semi-online preemptive algorithms for machine covering on two uniform machines
Theoretical Computer Science
Semi-online machine covering for two uniform machines
Theoretical Computer Science
Maximizing the minimum load for selfish agents
Theoretical Computer Science
Note: Tight bounds for bandwidth allocation on two links
Discrete Applied Mathematics
Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
Information and Computation
Maximizing the minimum load for selfish agents
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Max-min online allocations with a reordering buffer
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
On-line machine covering on two machines with local migration
Computers & Mathematics with Applications
| Hi-index | 0.00 |