A 3/2-approximation algorithm for generalized steiner trees in complete graphs with edge lengths 1 and 2

Piotr Berman, Marek Karpinski, Alexander Zelikovsky

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

    Abstract

    Given a graph with edge lengths and a set of pairs of vertices which should be connected (requirements) the Generalized Steiner Tree Problem (GSTP) asks for a minimum length subgraph that connects every requirement. For the Generalized Steiner Tree Problem restricted to complete graphs with edge lengths 1 and 2, we provide a 1.5-approximation algorithm. It is the first algorithm with the approximation ratio significantly better than 2 for a class of graphs for which GSTP is MAX SNP-hard.

    Original languageEnglish (US)
    Title of host publicationAlgorithms and Computation - 21st International Symposium, ISAAC 2010, Proceedings
    Pages15-24
    Number of pages10
    EditionPART 1
    DOIs
    StatePublished - 2010
    Event21st Annual International Symposium on Algorithms and Computations, ISAAC 2010 - Jeju Island, Korea, Republic of
    Duration: Dec 15 2010Dec 17 2010

    Publication series

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

    Other

    Other21st Annual International Symposium on Algorithms and Computations, ISAAC 2010
    CountryKorea, Republic of
    CityJeju Island
    Period12/15/1012/17/10

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'A 3/2-approximation algorithm for generalized steiner trees in complete graphs with edge lengths 1 and 2'. Together they form a unique fingerprint.

    Cite this