American Psychological Association 6th edition

GAIRING, M., MONIEN, B., & WOCLAW, A. (2007, January 1). A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. 380(1-2). Amsterdam: Elsevier, 2007. Retrieved from http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18821615

ISO-690 (author-date, English)

GAIRING, Martin, MONIEN, Burkhard and WOCLAW, Andreas, 2007. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. In: [online]. Amsterdam: Elsevier, 2007. 1 January 2007. Available from: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18821615

Modern Language Association 9th edition

GAIRING, M., B. MONIEN, and A. WOCLAW. A faster combinatorial approximation algorithm for scheduling unrelated parallel machines. no. 1-2, Amsterdam: Elsevier, 2007., 2007, http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18821615.

Mohr Siebeck - Recht (Deutsch - Österreich)

Emerald - Harvard

GAIRING, M., MONIEN, B. and WOCLAW, A. (2007), “A faster combinatorial approximation algorithm for scheduling unrelated parallel machines”, in , Vol. 380, Amsterdam: Elsevier, 2007., available at: http://pascal-francis.inist.fr/vibad ndex.php?action=search&terms=18821615.

Warning: These citations may not always be 100% accurate.