Short trees in polygons
type: Item
instance of: scholarly article
title: Short trees in polygons
zbMATH Open document ID: 1004.68182
DOI: 10.1016/S0166-218X(01)00256-6
author: V. Pereyra
published in: Discrete Applied Mathematics
publication date: 2002-05-15T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1741965
zbMATH Keywords: obstacle-avoiding Steiner trees
zbMATH Keywords: Euclidean tree
describes a project that uses: LEDA
MaRDI profile type: Publication
cites work: A heuristic for Euclidean and rectilinear Steiner problems
cites work: The Steiner tree problem
cites work: An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
cites work: Q4702188
cites work: A new approach for the geodesic Voronoi diagram of points in a simple polygon and other restricted polygonal domains
cites work: An Approximation Scheme for Finding Steiner Trees with Obstacles
cites work: Q4395337
cites work: Q4945796
cites work: Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
cites work: Local search for the Steiner tree problem in the Euclidean plane
cites work: Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
full work available at URL: s0166-218x(01)00256-6
OpenAlex ID: W2089362834
description: scientific article; zbMATH DE number 1741965