Steiner trees with \(n\) terminals among \(n+1\) nodes
type: Item
instance of: scholarly article
title: Steiner trees with \(n\) terminals among \(n+1\) nodes
zbMATH Open document ID: 0768.90076
DOI: 10.1016/0167-6377(92)90075-E
author: A. Prodon
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 92006
zbMATH Keywords: spanning tree
zbMATH Keywords: polyhedra
zbMATH Keywords: connected undirected graph
zbMATH Keywords: terminals
zbMATH Keywords: Steiner tree
MaRDI profile type: Publication
cites work: The steiner problem in graphs
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: A weighted matroid intersection algorithm
cites work: Efficient algorithms for a family of matroid intersection problems
cites work: Q4198056
cites work: Q4130999
cites work: Q3760270
cites work: Steiner problem in networks: A survey
description: scientific article; zbMATH DE number 92006