Heuristic Approaches for Rectilinear Steiner Tree Problem

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F00%3A00000125" target="_blank" >RIV/00216305:26210/00:00000125 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

čeština

Original language name

Heuristic Approaches for Rectilinear Steiner Tree Problem

Original language description

The rectilinear Steiner tree problem asks for a shortest tree connecting given points in the plane with rectilinear distance. The problem is known to be NP-complete, so many approximation algorithms for rectilinear Steiner trees appeared in the last decade. This paper reviews typical exact and approximate algorithms and proposes another approach combining these algorithms with stochastic heuristic techniques.

Czech name

Heuristic Approaches for Rectilinear Steiner Tree Problem

Czech description

—

Type

D - Article in proceedings

CEP classification

BB - Applied statistics, operational research

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year

2000

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

6th International Conference on Soft Computing MENDEL 2000

ISBN

80-214-1609-2

ISSN

—

e-ISSN

—

Number of pages

6

Pages from-to

—

Publisher name

PC-DIR Brno

Place of publication

Brno, Czech Republic

Event location

—

Event date

—

Type of event by nationality

—

UT code for WoS article

—