BAMPIS, Evripidis, JANSEN, Klaus und KENYON, Claire (Hrsg.). 1 st ed. 2006. Berlin, Heidelberg: Springer Berlin Heidelberg. ISBN 9783540322139.
Elsevier - Harvard (with titles)Bampis, E., Jansen, K., Kenyon, C. (Hrsg.), 2006. Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications, 1 st ed. 2006. ed, Theoretical Computer Science and General Issues. Springer Berlin Heidelberg, Berlin, Heidelberg. https://doi.org/10.1007/11671541
American Psychological Association 7th editionEfficient 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
Springer - Basic (author-date)Bampis E, Jansen K, Kenyon C (Hrsg.) (2006) Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications, 1 st ed. 2006. Springer Berlin Heidelberg, Berlin, Heidelberg
Juristische Zitierweise (Stüber) (Deutsch)Bampis, Evripidis/ Jansen, Klaus/ Kenyon, Claire (Hrsg.), Efficient Approximation and Online Algorithms : Recent Progress on Classical Combinatorial Optimization Problems and New Applications, 1 st ed. 2006 , Berlin, Heidelberg 2006.