Approximation algorithms for stochastic scheduling on unrelated machines
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008. === Includes bibliographical references (p. 59-60). === Motivated by problems in distributed computing, this thesis presents the first nontrivial polynomial time approximation algorithms...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Massachusetts Institute of Technology
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/45750 |