@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 Cost-Distance Steiner Tree Problem}},
  booktitle =	{Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)},
  pages =	{19:1--19:16},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-296-9},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{275},
  editor =	{Megow, Nicole and Smith, Adam},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.19},
  URN =		{urn:nbn:de:0030-drops-188443},
  doi =		{10.4230/LIPIcs.APPROX/RANDOM.2023.19},
  annote =	{Keywords: cost-distance Steiner tree, approximation algorithm, uniform}
}