Networks

Approximating Steiner trees in graphs with restricted weights

Journal Article

  • Author(s): Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani
  • Article first published online: 07 Dec 1998
  • DOI: 10.1002/(SICI)1097-0037(199807)31:4<283::AID-NET8>3.0.CO;2-9
  • Read on Online Library
  • Subscribe to Journal

Abstract

We analyze the approximation ratio of the average distance heuristic for the Steiner tree problem on graphs and prove nearly tight bounds for the cases of complete graphs with binary weights {1, d} or weights in the interval [1, d], where d ≤ 2. The improvement over other analyzed algorithms is a factor of about e ≈ 2.718. © 1998 John Wiley & Sons, Inc. Networks 31: 283–292, 1998

Related Topics

Related Publications

Related Content

Site Footer

Address:

This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on StatisticsViews.com are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and StatisticsViews.com express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.