%0 Conference Paper %1 conf/ipco/LinharesS16 %A Linhares, André %A Swamy, Chaitanya %B IPCO %D 2016 %E Louveaux, Quentin %E Skutella, Martin %I Springer %K dblp %P 38-49 %T Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. %U http://dblp.uni-trier.de/db/conf/ipco/ipco2016.html#LinharesS16 %V 9682 %@ 978-3-319-33460-8

@inproceedings{conf/ipco/LinharesS16, added-at = {2017-05-22T00:00:00.000+0200}, author = {Linhares, André and Swamy, Chaitanya}, biburl = {https://www.bibsonomy.org/bibtex/2b8f4132c502803544e7ea047bb8fb9b4/dblp}, booktitle = {IPCO}, crossref = {conf/ipco/2016}, editor = {Louveaux, Quentin and Skutella, Martin}, ee = {https://doi.org/10.1007/978-3-319-33461-5_4}, interhash = {da77a70e97f4079909b25d0eefb0bdf5}, intrahash = {b8f4132c502803544e7ea047bb8fb9b4}, isbn = {978-3-319-33460-8}, keywords = {dblp}, pages = {38-49}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T16:32:10.000+0200}, title = {Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems.}, url = {http://dblp.uni-trier.de/db/conf/ipco/ipco2016.html#LinharesS16}, volume = 9682, year = 2016 }