Cite Them Right 11th edition - Harvard

Bampis, E., Jansen, K. und Kenyon, C. (Hrsg.) (2006) Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications [cd]. 1 st ed. 2006, Theoretical Computer Science and General Issues. 1 st ed. 2006. Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/11671541.

Chicago Manual of Style 17th edition (full note)

Bampis, Evripidis, Klaus Jansen, und Claire Kenyon, Hrsg. Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications. Cd. Theoretical Computer Science and General Issues. 1 st ed. 2006. Berlin, Heidelberg: Springer Berlin Heidelberg, [2006?], Berlin, Heidelberg: Springer Berlin Heidelberg, [2006?]. https://doi.org/10.1007/11671541.

American Psychological Association 7th edition

Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications. (ca. 2006). [Cd]. In E. Bampis, K. Jansen, & C. Kenyon (Hrsg.), Theoretical Computer Science and General Issues (1 st ed. 2006). Springer Berlin Heidelberg. https://doi.org/10.1007/11671541

Modern Language Association 9th edition

Bampis, E., K. Jansen, und C. Kenyon, Herausgeber. „Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications“. Theoretical Computer Science and General Issues, 1 st ed. 2006, cd, Springer Berlin Heidelberg, 2006, https://doi.org/10.1007/11671541.

ISO-690 (author-date, Deutsch)

BAMPIS, Evripidis, Klaus JANSEN und Claire KENYON (Hrsg.). 1 st ed. 2006. Berlin, Heidelberg: Springer Berlin Heidelberg. ISBN 9783540322139

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