A Heuristic Solution of a Cutting Problem Using Hypergraphs
Deppe C, Wischmann C (2013)
In: Information Theory, Combinatorics, and Search Theory. Aydinian H, Cicalese F, Deppe C (Eds); Lecture Notes in Computer Science, 7777. Berlin, Heidelberg: Springer Berlin Heidelberg: 658-676.
Sammelwerksbeitrag
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Deppe, ChristianUniBi;
Wischmann, Christian
Herausgeber*in
Aydinian, Harout;
Cicalese, Ferdinando;
Deppe, Christian
Einrichtung
Erscheinungsjahr
2013
Buchtitel
Information Theory, Combinatorics, and Search Theory
Serientitel
Lecture Notes in Computer Science
Band
7777
Seite(n)
658-676
ISBN
978-3-642-36898-1
Page URI
https://pub.uni-bielefeld.de/record/2656571
Zitieren
Deppe C, Wischmann C. A Heuristic Solution of a Cutting Problem Using Hypergraphs. In: Aydinian H, Cicalese F, Deppe C, eds. Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science. Vol 7777. Berlin, Heidelberg: Springer Berlin Heidelberg; 2013: 658-676.
Deppe, C., & Wischmann, C. (2013). A Heuristic Solution of a Cutting Problem Using Hypergraphs. In H. Aydinian, F. Cicalese, & C. Deppe (Eds.), Lecture Notes in Computer Science: Vol. 7777. Information Theory, Combinatorics, and Search Theory (pp. 658-676). Berlin, Heidelberg: Springer Berlin Heidelberg. doi:10.1007/978-3-642-36899-8_33
Deppe, Christian, and Wischmann, Christian. 2013. “A Heuristic Solution of a Cutting Problem Using Hypergraphs”. In Information Theory, Combinatorics, and Search Theory, ed. Harout Aydinian, Ferdinando Cicalese, and Christian Deppe, 7777:658-676. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg.
Deppe, C., and Wischmann, C. (2013). “A Heuristic Solution of a Cutting Problem Using Hypergraphs” in Information Theory, Combinatorics, and Search Theory, Aydinian, H., Cicalese, F., and Deppe, C. eds. Lecture Notes in Computer Science, vol. 7777, (Berlin, Heidelberg: Springer Berlin Heidelberg), 658-676.
Deppe, C., & Wischmann, C., 2013. A Heuristic Solution of a Cutting Problem Using Hypergraphs. In H. Aydinian, F. Cicalese, & C. Deppe, eds. Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science. no.7777 Berlin, Heidelberg: Springer Berlin Heidelberg, pp. 658-676.
C. Deppe and C. Wischmann, “A Heuristic Solution of a Cutting Problem Using Hypergraphs”, Information Theory, Combinatorics, and Search Theory, H. Aydinian, F. Cicalese, and C. Deppe, eds., Lecture Notes in Computer Science, vol. 7777, Berlin, Heidelberg: Springer Berlin Heidelberg, 2013, pp.658-676.
Deppe, C., Wischmann, C.: A Heuristic Solution of a Cutting Problem Using Hypergraphs. In: Aydinian, H., Cicalese, F., and Deppe, C. (eds.) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science. 7777, p. 658-676. Springer Berlin Heidelberg, Berlin, Heidelberg (2013).
Deppe, Christian, and Wischmann, Christian. “A Heuristic Solution of a Cutting Problem Using Hypergraphs”. Information Theory, Combinatorics, and Search Theory. Ed. Harout Aydinian, Ferdinando Cicalese, and Christian Deppe. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.Vol. 7777. Lecture Notes in Computer Science. 658-676.
Material in PUB:
Teil von PUB Eintrag
Information theory, Combinatoric and Search Theory: In Memory of Rudolf Ahlswede
Aydinian H, Cicalese F, Deppe C (Eds) (2013) Lecture Notes in Computer Science; 7777.
Heidelberg: Springer Verlag.
Aydinian H, Cicalese F, Deppe C (Eds) (2013) Lecture Notes in Computer Science; 7777.
Heidelberg: Springer Verlag.
Google Scholar
ISBN Suche