Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights. Dinitz, M.; Kortsarz, G.; and Nutov, Z. In Jansen, K.; Rolim, J. D. P.; Devanur, N. R.; and Moore, C., 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, 2014. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights [link]Paper  doi  bibtex   
@inproceedings{DBLP:conf/approx/DinitzKN14,
  author    = {Michael Dinitz and
               Guy Kortsarz and
               Zeev Nutov},
  editor    = {Klaus Jansen and
               Jos{\'{e}} D. P. Rolim and
               Nikhil R. Devanur and
               Cristopher Moore},
  title     = {Improved Approximation Algorithm for Steiner k-Forest with Nearly
               Uniform Weights},
  booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
               and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,
               Spain},
  series    = {LIPIcs},
  volume    = {28},
  pages     = {115--127},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2014},
  url       = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115},
  doi       = {10.4230/LIPIcs.APPROX-RANDOM.2014.115},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/approx/DinitzKN14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0