1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Computational Complexity, Discrete Mathematics, Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/171231

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0810.1851
 http://arxiv.org/abs/0810.1851

Collections

arXiv