1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Computational Complexity
2008-10-13 v1 Discrete Mathematics
Data Structures and Algorithms
Abstract
We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
Keywords
Cite
@article{arxiv.0810.1851,
title = {1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two},
author = {Piotr Berman and Marek Karpinski and Alex Zelikovsky},
journal= {arXiv preprint arXiv:0810.1851},
year = {2008}
}