Approaching the 5/4-approximation for rectilinear Steiner trees

Piotr Berman, Ulrich Fößmeier, Marek Karpinski, Michael Kaufmann, Alexander Zelikovsky

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

    4 Scopus citations


    The rectilinear Steiner tree problem requires to find a shortest tree connecting a given set of terminal points in the plane with rectilinear distance. We show that the performance ratios of Zelikovsky’s[17] heuristic is between 1.3 and 1.3125 (before it was only bounded from above by 1.375), while the performance ratio of the heuristic of Berman and Ramaiyer[l] is at most 1.271 (while the previous bound was 1.347). Moreover, we provide (formula Presented)-time algorithms that satisfy these performance ratios.

    Original languageEnglish (US)
    Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
    EditorsJan van Leeuwen
    PublisherSpringer Verlag
    Number of pages12
    ISBN (Print)9783540584346
    StatePublished - 1994
    Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
    Duration: Sep 26 1994Sep 28 1994

    Publication series

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


    Other2nd Annual European Symposium on Algorithms, ESA 1994

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • General Computer Science


    Dive into the research topics of 'Approaching the 5/4-approximation for rectilinear Steiner trees'. Together they form a unique fingerprint.

    Cite this