Go to the corresponding LIPIcs Volume Portal 
Dvorák, Pavel ; Feldmann, Andreas Emil ; Knop, Dušan ; Masarík, Tomáš ; Toufar, Tomáš ; Veselý, Pavel
pdfformat: 

@InProceedings{dvork_et_al:LIPIcs:2018:8515, author = {Pavel Dvor{\'a}k and Andreas Emil Feldmann and Du{\v{s}}an Knop and Tom{\'a}{\v{s}} Masar{\'i}k and Tom{\'a}{\v{s}} Toufar and Pavel Vesel{\'y}}, title = {{Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices}}, booktitle = {35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)}, pages = {26:126:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770620}, ISSN = {18688969}, year = {2018}, volume = {96}, editor = {Rolf Niedermeier and Brigitte Vall{\'e}e}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8515}, URN = {urn:nbn:de:0030drops85158}, doi = {10.4230/LIPIcs.STACS.2018.26}, annote = {Keywords: Steiner Tree, Steiner Forest, Approximation Algorithms, Parameterized Algorithms, Lossy Kernelization} }
Keywords:  Steiner Tree, Steiner Forest, Approximation Algorithms, Parameterized Algorithms, Lossy Kernelization  
Seminar:  35th Symposium on Theoretical Aspects of Computer Science (STACS 2018)  
Issue Date:  2018  
Date of publication:  20.02.2018 