Scheduling unrelated machines with costs

Many birds with one stone: multi-objective approximation algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Web caching using access statistics

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms

Improved algorithms for the data placement problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms

Approximation algorithms for general parallel task scheduling

Information Processing Letters

Resource constrained scheduling on multiple machines

Information Processing Letters

Load balancing in large-scale RFID systems

Computer Networks: The International Journal of Computer and Telecommunications Networking

Bi-objective Approximation Scheme for Makespan and Reliability Optimization on Uniform Parallel Machines

Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing

Non-clairvoyant speed scaling for batched parallel jobs on multiprocessors

Proceedings of the 6th ACM conference on Computing frontiers

Budgeted matching and budgeted matroid intersection via the gasoline puzzle

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

Santa Claus schedules jobs on unrelated machines

Proceedings of the forty-third annual ACM symposium on Theory of computing

Approximation schemes for generalized two-dimensional vector packing with application to data placement

Journal of Discrete Algorithms

Optimizing performance and reliability on heterogeneous parallel systems: Approximation algorithms and heuristics

Journal of Parallel and Distributed Computing

Minimal cost reconfiguration of data placement in storage area network

WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms

Minimal cost reconfiguration of data placement in a storage area network

Theoretical Computer Science