A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2

DOI10.1007/978-3-642-17517-6_4zbMath1310.68234OpenAlexW1606383090MaRDI QIDQ3060717

Piotr Berman, Alexander Z. Zelikovsky, Marek Karpinski

Publication date: 9 December 2010

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-17517-6_4

zbMATH Keywords

approximation algorithmsSteiner treesgeneralized Steiner trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

This page was built for publication: A 3/2-Approximation Algorithm for Generalized Steiner Trees in Complete Graphs with Edge Lengths 1 and 2