Go to the corresponding LIPIcs Volume Portal 
Foos, Josefine ; Held, Stephan ; Spitzley, Yannik Kyle Dustin
pdfformat: 

@InProceedings{foos_et_al:LIPIcs.APPROX/RANDOM.2023.19, author = {Foos, Josefine and Held, Stephan and Spitzley, Yannik Kyle Dustin}, title = {{Tighter Approximation for the Uniform CostDistance Steiner Tree Problem}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)}, pages = {19:119:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959772969}, ISSN = {18688969}, year = {2023}, volume = {275}, editor = {Megow, Nicole and Smith, Adam}, publisher = {Schloss Dagstuhl  LeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18844}, URN = {urn:nbn:de:0030drops188443}, doi = {10.4230/LIPIcs.APPROX/RANDOM.2023.19}, annote = {Keywords: costdistance Steiner tree, approximation algorithm, uniform} }
Keywords:  costdistance Steiner tree, approximation algorithm, uniform  
Collection:  Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)  
Issue Date:  2023  
Date of publication:  04.09.2023 