Publication detail

An Approximation for the Steiner Tree Problem in the Euclidean Plane

ŠEDA, M.

English title

An Approximation for the Steiner Tree Problem in the Euclidean Plane

Type

conference paper

Language

en

Original abstract

The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.

English abstract

The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.

Keywords in English

Steiner tree, minimum spanning tree, Delaunay triangulation, heuristic

RIV year

2003

Released

01.09.2003

Publisher

Universitat Politecnica de Catalunya

Location

Barcelona (Spain)

ISBN

9958-617-18-8

Book

Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003

Pages count

4

BIBTEX


@inproceedings{BUT13220,
  author="Miloš {Šeda},
  title="An Approximation for the Steiner Tree Problem in the Euclidean Plane",
  booktitle="Proceedings of the 7th International Research/Expert Conference Trends in the Development of Machinery and Associated Technology TMT 2003",
  year="2003",
  month="September",
  publisher="Universitat Politecnica de Catalunya",
  address="Barcelona (Spain)",
  isbn="9958-617-18-8"
}