On Steiner trees and minimum spanning trees in hypergraphs
type: Item
instance of: scholarly article
title: On Steiner trees and minimum spanning trees in hypergraphs
zbMATH Open document ID: 1013.90131
DOI: 10.1016/S0167-6377(02)00185-2
author: Tobias Polzin
author: Siavash Vahdati Daneshmand
published in: Operations Research Letters
publication date: 2003-05-04T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 1903522
zbMATH Keywords: Steiner problem
zbMATH Keywords: relaxation
zbMATH Keywords: linear programming
describes a project that uses: SteinLib
describes a project that uses: GeoSteiner
MaRDI profile type: Publication
cites work: An integer linear programming approach to the steiner problem in graphs
cites work: The Steiner tree problem
cites work: Solving Steiner tree problems in graphs to optimality
cites work: Q4845371
cites work: A comparison of Steiner tree relaxations
cites work: Improved algorithms for the Steiner problem in networks
cites work: Q4411411
cites work: Q4395337
cites work: Q4945796
cites work: A dual ascent approach for steiner tree problems on a directed graph
Recommended article: On Steiner minimal trees with \(L_ p\) distance
Recommended article: The Steiner tree problem on graphs: inapproximability results
Recommended article: Minimal spanning trees and Stein's method
Recommended article: Q4247448
Recommended article: Q3693291
Recommended article: Q4264560
Recommended article: Q4945798
Recommended article: Q4400842
Recommended article: On Min-Power Steiner Tree
Recommended article: Steiner trees, connected domination and strongly chordal graphs
description: scientific article; zbMATH DE number 1903522