{"_id":"7A6DJW8WLM2Sxqzdh","bibbaseid":"dinitz-kortsarz-nutov-improvedapproximationalgorithmforsteinerkforestwithnearlyuniformweights-2014","authorIDs":[],"author_short":["Dinitz, M.","Kortsarz, G.","Nutov, Z."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Michael"],"propositions":[],"lastnames":["Dinitz"],"suffixes":[]},{"firstnames":["Guy"],"propositions":[],"lastnames":["Kortsarz"],"suffixes":[]},{"firstnames":["Zeev"],"propositions":[],"lastnames":["Nutov"],"suffixes":[]}],"editor":[{"firstnames":["Klaus"],"propositions":[],"lastnames":["Jansen"],"suffixes":[]},{"firstnames":["José","D.","P."],"propositions":[],"lastnames":["Rolim"],"suffixes":[]},{"firstnames":["Nikhil","R."],"propositions":[],"lastnames":["Devanur"],"suffixes":[]},{"firstnames":["Cristopher"],"propositions":[],"lastnames":["Moore"],"suffixes":[]}],"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ü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","bibtex":"@inproceedings{DBLP:conf/approx/DinitzKN14,\n author = {Michael Dinitz and\n Guy Kortsarz and\n Zeev Nutov},\n editor = {Klaus Jansen and\n Jos{\\'{e}} D. P. Rolim and\n Nikhil R. Devanur and\n Cristopher Moore},\n title = {Improved Approximation Algorithm for Steiner k-Forest with Nearly\n Uniform Weights},\n booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms\n and Techniques, {APPROX/RANDOM} 2014, September 4-6, 2014, Barcelona,\n Spain},\n series = {LIPIcs},\n volume = {28},\n pages = {115--127},\n publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\\\"{u}}r Informatik},\n year = {2014},\n url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115},\n doi = {10.4230/LIPIcs.APPROX-RANDOM.2014.115},\n timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/approx/DinitzKN14.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Dinitz, M.","Kortsarz, G.","Nutov, Z."],"editor_short":["Jansen, K.","Rolim, J. D. P.","Devanur, N. R.","Moore, C."],"key":"DBLP:conf/approx/DinitzKN14","id":"DBLP:conf/approx/DinitzKN14","bibbaseid":"dinitz-kortsarz-nutov-improvedapproximationalgorithmforsteinerkforestwithnearlyuniformweights-2014","role":"author","urls":{"Paper":"https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2014.115"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/pid/27/2346.bib","creationDate":"2020-11-09T18:52:44.355Z","downloads":0,"keywords":[],"search_terms":["improved","approximation","algorithm","steiner","forest","nearly","uniform","weights","dinitz","kortsarz","nutov"],"title":"Improved Approximation Algorithm for Steiner k-Forest with Nearly Uniform Weights","year":2014,"dataSources":["J47sPXJH6Qz5BncQX"]}