Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights

Michael Dinitz, Guy Kortsarz, Zeev Nutov. Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. In Klaus Jansen, José D. P. Rolim, Nikhil R. Devanur, Cristopher Moore, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain. Volume 28 of LIPIcs, pages 115-127, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2014. [doi]

@inproceedings{DinitzKN14,
  title = {Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights},
  author = {Michael Dinitz and Guy Kortsarz and Zeev Nutov},
  year = {2014},
  doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.115},
  url = {http://dx.doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115},
  researchr = {https://researchr.org/publication/DinitzKN14},
  cites = {0},
  citedby = {0},
  pages = {115-127},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain},
  editor = {Klaus Jansen and José D. P. Rolim and Nikhil R. Devanur and Cristopher Moore},
  volume = {28},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-74-3},
}