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

Piotr Berman, Marek Karpinski, Alexander Zelikovsky

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    6 Scopus citations

    Abstract

    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.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Data Structures - 11th International Symposium, WADS 2009, Proceedings
    Pages86-97
    Number of pages12
    DOIs
    StatePublished - Sep 14 2009
    Event11th International Symposium on Algorithms and Data Structures, WADS 2009 - Banff, AB, Canada
    Duration: Aug 21 2009Aug 23 2009

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume5664 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other11th International Symposium on Algorithms and Data Structures, WADS 2009
    CountryCanada
    CityBanff, AB
    Period8/21/098/23/09

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of '1.25-approximation algorithm for steiner tree problem with distances 1 and 2'. Together they form a unique fingerprint.

    Cite this