Abstract
Given a graph with edge lengths and a set of pairs of vertices which should be connected (requirements) the Generalized Steiner Tree Problem (GSTP) asks for a minimum length subgraph that connects every requirement. For the Generalized Steiner Tree Problem restricted to complete graphs with edge lengths 1 and 2, we provide a 1.5-approximation algorithm. It is the first algorithm with the approximation ratio significantly better than 2 for a class of graphs for which GSTP is MAX SNP-hard. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Berman, P., Karpinski, M., & Zelikovsky, A. (2010). A 3/2-approximation algorithm for generalized steiner trees in complete graphs with edge lengths 1 and 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6506 LNCS, pp. 15–24). https://doi.org/10.1007/978-3-642-17517-6_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
