TY - GEN

T1 - 1.25-approximation algorithm for steiner tree problem with distances 1 and 2

AU - Berman, Piotr

AU - Karpinski, Marek

AU - Zelikovsky, Alexander

PY - 2009/9/14

Y1 - 2009/9/14

N2 - Given a connected graph G = (V,E) with nonnegative costs on edges, , and a subset of terminal nodes R ⊂ V, the Steiner tree problem asks for the minimum cost subgraph of G spanning R. The Steiner Tree Problem with distances 1 and 2 (i.e., when the cost of any edge is either 1 or 2) has been investigated for long time since it is MAX SNP-hard and admits better approximations than the general problem. We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances 1 and 2, improving on the previously best known ratio of 1.279.

AB - Given a connected graph G = (V,E) with nonnegative costs on edges, , and a subset of terminal nodes R ⊂ V, the Steiner tree problem asks for the minimum cost subgraph of G spanning R. The Steiner Tree Problem with distances 1 and 2 (i.e., when the cost of any edge is either 1 or 2) has been investigated for long time since it is MAX SNP-hard and admits better approximations than the general problem. We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances 1 and 2, improving on the previously best known ratio of 1.279.

UR - http://www.scopus.com/inward/record.url?scp=69949120137&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69949120137&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-03367-4_8

DO - 10.1007/978-3-642-03367-4_8

M3 - Conference contribution

AN - SCOPUS:69949120137

SN - 3642033660

SN - 9783642033667

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 86

EP - 97

BT - Algorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings

T2 - 11th International Symposium on Algorithms and Data Structures, WADS 2009

Y2 - 21 August 2009 through 23 August 2009

ER -