Publication View

A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two (2008)

Abstract
We design a 3/2 approximation algorithm for the Generalized Steiner Tree problem (GST) in metrics with distances 1 and 2. This is the first polynomial time approximation algorithm for a wide class of non-geometric metric GST instances with approximation factor below 2.

Publication details
Download http://arxiv.org/abs/0812.2137
Repository arXiv (United States)
Keywords Computer Science - Computational Complexity, Computer Science - Discrete Mathematics, Computer Science - Data Structures and Algorithms
Type text