Go to the corresponding LIPIcs Volume Portal 
Könemann, Jochen ; Olver, Neil ; Pashkovich, Kanstantsin ; Ravi, R. ; Swamy, Chaitanya ; Vygen, Jens
pdfformat: 

@InProceedings{knemann_et_al:LIPIcs:2017:7566, author = {Jochen K{\"o}nemann and Neil Olver and Kanstantsin Pashkovich and R. Ravi and Chaitanya Swamy and Jens Vygen}, title = {{On the Integrality Gap of the PrizeCollecting Steiner Forest LP}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)}, pages = {17:117:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770446}, ISSN = {18688969}, year = {2017}, volume = {81}, editor = {Klaus Jansen and Jos{\'e} D. P. Rolim and David Williamson and Santosh S. Vempala}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7566}, URN = {urn:nbn:de:0030drops75665}, doi = {10.4230/LIPIcs.APPROXRANDOM.2017.17}, annote = {Keywords: Integrality gap, Steiner tree, Steiner forest, prizecollecting, Lagrangianmultiplier preserving} }
Keywords:  Integrality gap, Steiner tree, Steiner forest, prizecollecting, Lagrangianmultiplier preserving  
Seminar:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017)  
Issue Date:  2017  
Date of publication:  31.07.2017 