Fast monotone 3-approximation algorithm for scheduling related machines

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 616-627

  Kovács, Annamária ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTEGER PROGRAMMING; PARALLEL PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

APPROXIMATION ALGORITHMS; MONOTONICITY; SCHEDULING ALGORITHMS; SCHEDULING RELATED MACHINES;

APPROXIMATION THEORY;

EID: 27144510585     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_55     Document Type: Conference Paper

References (10)

1. A. Archer. Mechanisms for Discrete Optimization with Rational Agents. PhD thesis, Cornell University, 2004.
2. A. Archer and E. Tardos. Truthful mechanisms for one-parameter agents. In Proc. 42nd IEEE Symp. on Found, of Comp. Sci. (FOCS), pages 482-491, 2001.
3. D.S. Hochbaum and D.B. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comp., 17(3):539-551, 1988.
4. E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling non-identical processors. Journal of the ACM, 23:317-327, 1976.
5. A. Kovács. Fast monotone 3-approximation algorithm for scheduling related machines. Extended version: http://www.mpi-sb.mpg.de/~panni/greedy.ps.
6. D.S. Johnson M.R. Garey. Computers and Intractability; A Guide to the Theory of NP-completeness. Freeman, San Francisco, 1979.
7. Y. Azar N. Andelman and M. Sorani. Truthful approximation mechanisms for scheduling selfish related machines. In Proc. 22nd Ann. Symp. on Theor. Aspects of Comp. Sci. (STACS), volume 3404 of LNCS, pages 69-82, 2005.
8. V. Auletta P. Ambrosio. Deterministic monotone algorithms for scheduling on related machines. In Proc. 2nd Ws. on Approx. and Online Alg. (WAOA), 2004.
9. V. Auletta R. De Prisco P. Penna and G. Persiano. Deterministic truthful approximation mechanisms for scheduling related machines. In Proc. of 21st STACS, volume 2996 of LNCS, pages 608-619. Springer, 2004.
10. O.H. Ibarra T. Gonzalez and S. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23:317-327, 1976.