Tighter approximation for the uniform cost-distance Steiner tree problem

DOI10.4230/LIPICS.APPROX/RANDOM.2023.19MaRDI QIDQ6663032zbMATH OpenFDO

Authors Josefine Foos, Stephan Held, Yannik Kyle Dustin Spitzley

Publication date 14 January 2025

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2023.19

zbMATH Keywords

approximation algorithmcost-distance Steiner treeuniform

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25) Combinatorial optimization (90C27)

This page was built for publication: Tighter approximation for the uniform cost-distance Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6663032)