American Psychological Association 6th edition

Bley, A. [ca. 2006]. Approximability of unsplittable shortest path routing problems. In ZIB-report [Cd]. Berlin-Dahlem: ZIB.

ISO-690 (author-date, English)

BLEY, Andreas, 2006. Approximability of unsplittable shortest path routing problems. Berlin-Dahlem: ZIB.

Modern Language Association 9th edition

Bley, A. „Approximability of unsplittable shortest path routing problems“. ZIB-report, cd, ZIB, 2006.

Mohr Siebeck - Recht (Deutsch - Österreich)

Bley, Andreas: Approximability of unsplittable shortest path routing problems, Berlin-Dahlem 2006.

Emerald - Harvard

Bley, A. (2006), Approximability of unsplittable shortest path routing problems, ZIB-report, Bd. , ZIB, Berlin-Dahlem.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.