Comments on Bern's probabilistic results on rectilinear Steiner trees
type: Item
instance of: scholarly article
title: Comments on Bern's probabilistic results on rectilinear Steiner trees
zbMATH Open document ID: 0697.68039
DOI: 10.1007/BF01840406
author: Yi-Ching Yao
author: Frank K. Hwang
published in: Algorithmica
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05B07
zbMATH DE Number: 4143434
zbMATH Keywords: rectilinear spanning tree
zbMATH Keywords: rectilinear Steiner trees
MaRDI profile type: Publication
cites work: Two probabilistic results on rectilinear Steiner trees
cites work: On Steiner Minimal Trees with Rectilinear Distance
full work available at URL: https://doi.org/10.1007/bf01840406
OpenAlex ID: W1995157426
Recommended article: Two probabilistic results on rectilinear Steiner trees
Recommended article: Bounding the expected number of rectilinear full Steiner trees
Recommended article: Probabilistic analysis of an lp relaxation bound for the steiner problem in networks
Recommended article: Probabilistic models for the Steiner Tree problem
Recommended article: Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd
Recommended article: An inequality on Steiner trees
Recommended article: Q4779183
Recommended article: The Steiner tree problem on graphs: inapproximability results
Recommended article: On exact solutions for the rectilinear Steiner tree problem. I: Theoretical results
Recommended article: Probabilistic partitioning algorithms for the rectilinear steiner problem
description: scientific article; zbMATH DE number 4143434