New Approximation Algorithms for the Steiner Tree Problems

Marek Karpinski () and Alexander Zelikovsky ()
Additional contact information
Marek Karpinski: University of Bonn
Alexander Zelikovsky: University of Virginia

Journal of Combinatorial Optimization, 1997, vol. 1, issue 1, No 2, 47-65

Abstract: 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.

Keywords: Mathematical Modeling; Approximation Algorithm; Industrial Mathematic; Discrete Geometry; Approximation Ratio (search for similar items in EconPapers)
Date: 1997
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009758919736 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:1:y:1997:i:1:d:10.1023_a:1009758919736

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009758919736

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().