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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Computational Complexity, Discrete Mathematics, Data Structures and Algorithms

Citation

URI

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

Consulte el texto completo en el siguiente enlace:

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

Collections

arXiv