Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Journal Article
%1 journals/algorithmica/Solis-ObaBL17
%A Solis-Oba, Roberto
%A Bonsma, Paul S.
%A Lowski, Stefanie
%D 2017
%J Algorithmica
%K dblp
%N 2
%P 374-388
%T A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.
%U http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica77.html#Solis-ObaBL17
%V 77
@article{journals/algorithmica/Solis-ObaBL17,
added-at = {2017-04-18T00:00:00.000+0200},
author = {Solis-Oba, Roberto and Bonsma, Paul S. and Lowski, Stefanie},
biburl = {https://www.bibsonomy.org/bibtex/241e3eafe87241eaae208ba2201d0e975/dblp},
ee = {http://dx.doi.org/10.1007/s00453-015-0080-0},
interhash = {ecd537473e628584bb8e671e9c5518c1},
intrahash = {41e3eafe87241eaae208ba2201d0e975},
journal = {Algorithmica},
keywords = {dblp},
number = 2,
pages = {374-388},
timestamp = {2017-04-19T11:47:09.000+0200},
title = {A 2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves.},
url = {http://dblp.uni-trier.de/db/journals/algorithmica/algorithmica77.html#Solis-ObaBL17},
volume = 77,
year = 2017
}