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/stacs/MolleRR06
%A Mölle, Daniel
%A Richter, Stefan
%A Rossmanith, Peter
%B STACS
%D 2006
%E Durand, Bruno
%E Thomas, Wolfgang
%I Springer
%K
%P 561-570
%T A Faster Algorithm for the Steiner Tree Problem.
%U http://dblp.uni-trier.de/db/conf/stacs/stacs2006.html#MolleRR06
%V 3884
%@ 978-3-540-32288-7
@inproceedings{conf/stacs/MolleRR06,
added-at = {2023-12-12T18:53:14.000+0100},
author = {Mölle, Daniel and Richter, Stefan and Rossmanith, Peter},
biburl = {https://www.bibsonomy.org/bibtex/2fb349e3eb7b5c606d40ca605205e290b/admin},
booktitle = {STACS},
crossref = {conf/stacs/2006},
editor = {Durand, Bruno and Thomas, Wolfgang},
ee = {https://doi.org/10.1007/11672142_46},
interhash = {18a46a9f2f3b1e18c89b7b581c3190d8},
intrahash = {fb349e3eb7b5c606d40ca605205e290b},
isbn = {978-3-540-32288-7},
keywords = {},
pages = {561-570},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2023-12-12T18:53:14.000+0100},
title = {A Faster Algorithm for the Steiner Tree Problem.},
url = {http://dblp.uni-trier.de/db/conf/stacs/stacs2006.html#MolleRR06},
volume = 3884,
year = 2006
}