A Heuristic Solution of a Cutting Problem Using Hypergraphs.
C. Deppe, и C. Wischmann. Information Theory, Combinatorics, and Search Theory, том 7777 из Lecture Notes in Computer Science, стр. 658-676. Springer, (2013)
Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 conf/birthday/DeppeW13
%A Deppe, Christian
%A Wischmann, Christian
%B Information Theory, Combinatorics, and Search Theory
%D 2013
%E Aydinian, Harout K.
%E Cicalese, Ferdinando
%E Deppe, Christian
%I Springer
%K dblp
%P 658-676
%T A Heuristic Solution of a Cutting Problem Using Hypergraphs.
%U http://dblp.uni-trier.de/db/conf/birthday/ahlswede2013.html#DeppeW13
%V 7777
%@ 978-3-642-36898-1
@inproceedings{conf/birthday/DeppeW13,
added-at = {2017-05-23T00:00:00.000+0200},
author = {Deppe, Christian and Wischmann, Christian},
biburl = {https://www.bibsonomy.org/bibtex/258f776540b27bb8e411e927b900899b0/dblp},
booktitle = {Information Theory, Combinatorics, and Search Theory},
crossref = {conf/birthday/2013ahlswede},
editor = {Aydinian, Harout K. and Cicalese, Ferdinando and Deppe, Christian},
ee = {https://doi.org/10.1007/978-3-642-36899-8_33},
interhash = {9cbb447ccc686ceaa3c9d6a29afdf64e},
intrahash = {58f776540b27bb8e411e927b900899b0},
isbn = {978-3-642-36898-1},
keywords = {dblp},
pages = {658-676},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T12:21:07.000+0200},
title = {A Heuristic Solution of a Cutting Problem Using Hypergraphs.},
url = {http://dblp.uni-trier.de/db/conf/birthday/ahlswede2013.html#DeppeW13},
volume = 7777,
year = 2013
}
