@InProceedings{dinitz_et_al:LIPIcs.APPROX-RANDOM.2014.115,
author = {Dinitz, Michael and Kortsarz, Guy and Nutov, Zeev},
title = {{Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014)},
pages = {115--127},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-74-3},
ISSN = {1868-8969},
year = {2014},
volume = {28},
editor = {Jansen, Klaus and Rolim, Jos\'{e} and Devanur, Nikhil R. and Moore, Cristopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2014.115},
URN = {urn:nbn:de:0030-drops-46925},
doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.115},
annote = {Keywords: k-Steiner Forest; Uniform weights; Densest k-Subgraph; Approximation algorithms}
}