Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/cocoa/AlthausBDHK14
%A Althaus, Ernst
%A Blumenstock, Markus
%A Disterhoft, Alexej
%A Hildebrandt, Andreas
%A Krupp, Markus
%B COCOA
%D 2014
%E Zhang, Zhao
%E Wu, Lidong
%E Xu, Wen
%E Du, Ding-Zhu
%I Springer
%K dblp
%P 268-282
%T Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem.
%U http://dblp.uni-trier.de/db/conf/cocoa/cocoa2014.html#AlthausBDHK14
%V 8881
%@ 978-3-319-12690-6
@inproceedings{conf/cocoa/AlthausBDHK14,
added-at = {2017-06-29T00:00:00.000+0200},
author = {Althaus, Ernst and Blumenstock, Markus and Disterhoft, Alexej and Hildebrandt, Andreas and Krupp, Markus},
biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2246ffe02e35d19542b06ee73fb1e2eec/dblp},
booktitle = {COCOA},
crossref = {conf/cocoa/2014},
editor = {Zhang, Zhao and Wu, Lidong and Xu, Wen and Du, Ding-Zhu},
ee = {https://doi.org/10.1007/978-3-319-12691-3_21},
interhash = {a20872d337a593599e87b4faa551afd9},
intrahash = {246ffe02e35d19542b06ee73fb1e2eec},
isbn = {978-3-319-12690-6},
keywords = {dblp},
pages = {268-282},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-09-27T17:25:35.000+0200},
title = {Algorithms for the Maximum Weight Connected k -Induced Subgraph Problem.},
url = {http://dblp.uni-trier.de/db/conf/cocoa/cocoa2014.html#AlthausBDHK14},
volume = 8881,
year = 2014
}
