Using dual approximation algorithms for scheduling problems theoretical and practical results
Journal of the ACM (JACM)
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
The competitiveness of on-line assignments
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Tighter bounds on a heuristic for a partition problem
Information Processing Letters
Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Load balancing in the L/sub p/ norm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A PTAS for minimizing the weighted sum of job completion times on parallel machines
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Ancient and new algorithms for load balancing in the Lp norm
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
All-Norm Approximation Algorithms
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
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
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Server scheduling in the Lp norm: a rising tide lifts all boat
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Vector assignment problems: a general framework
Journal of Algorithms
Multi-processor scheduling to minimize flow time with ε resource augmentation
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
All-norm approximation algorithms
Journal of Algorithms
Approximation Algorithms for Scheduling on Multiple Machines
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Power-aware scheduling for makespan and flow
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A new model for selfish routing
Theoretical Computer Science
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the lpNorm
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
A Lower Bound for the On-Line Preemptive Machine Scheduling with lpNorm
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
Power-aware scheduling for makespan and flow
Journal of Scheduling
Designing PTASs for MIN-SUM scheduling problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
Robust algorithms for preemptive scheduling
ESA'11 Proceedings of the 19th European conference on Algorithms
Speed scaling of tasks with precedence constraints
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Tight bounds for selfish and greedy load balancing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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
Envy-ratio and average-nash social welfare optimization in multiagent resource allocation
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Energy-Efficient scheduling with time and processors eligibility restrictions
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
Matching with sizes (or scheduling with processing set restrictions)
Discrete Applied Mathematics
Hi-index | 0.00 |