On the approximability of dense Steiner problems

DOI10.1016/j.jda.2013.06.005zbMath1335.05173MaRDI QIDQ396661

Mathias Hauptmann

Publication date: 13 August 2014

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2013.06.005

zbMATH Keywords

approximation algorithms; dense instances; forest problems; Steiner tree problems

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

68W25: Approximation algorithms