Paper

A unified approach to scheduling on unrelated parallel machines

2009

Created by Alysson Bolognesi Prado at 2019-03-28 09:32:32.0.
Last updated by ACM worker at 2019-04-12 14:56:42.0.

Simplified Graph of Associations

Word Cloud

Bibliographic Sets

1

Research Paradigm

Authors

4

V. S. Anil Kumar

Madhav V. Marathe

Srinivasan Parthasarathy

Aravind Srinivasan

Venue

1

Journal of the ACM

References

22

Fairness in Routing and Load Balancing

Approximation Algorithms for Scheduling on Multiple Machines

Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity

Algorithms and Complexity

Approximation algorithms for scheduling unrelated parallel machines

Randomized rounding: A technique for provably good algorithms and algorithmic proofs

Referenced By

1

A Unified Rounding Algorithm For Unrelated Machines Scheduling Problems