IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v1y1997i1d10.1023_a1009758919736.html
   My bibliography  Save this article

New Approximation Algorithms for the Steiner Tree Problems

Author

Listed:
  • Marek Karpinski

    (University of Bonn
    International Computer Science Institute)

  • Alexander Zelikovsky

    (University of Virginia)

Abstract

The Steiner tree problem asks for the shortest tree connecting a given set of terminal points in a metric space. We design new approximation algorithms for the Steiner tree problems using a novel technique of choosing Steiner points in dependence on the possible deviation from the optimal solutions. We achieve the best up to now approximation ratios of 1.644 in arbitrary metric and 1.267 in rectilinear plane, respectively.

Suggested Citation

  • Marek Karpinski & Alexander Zelikovsky, 1997. "New Approximation Algorithms for the Steiner Tree Problems," Journal of Combinatorial Optimization, Springer, vol. 1(1), pages 47-65, March.
    • Handle: RePEc:spr:jcomop:v:1:y:1997:i:1:d:10.1023_a:1009758919736
    DOI: 10.1023/A:1009758919736
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009758919736
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009758919736?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lai, Xiaofan & Xu, Zhou, 2016. "Improved algorithms for joint optimization of facility locations and network connections," European Journal of Operational Research, Elsevier, vol. 250(3), pages 745-753.
    2. Longjiang Guo & Weili Wu & Feng Wang & My Thai, 2005. "An Approximation for Minimum Multicast Route in Optical Networks with Nonsplitting Nodes," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 391-394, December.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:1:y:1997:i:1:d:10.1023_a:1009758919736. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.