Steiner trees with \(n\) terminals among \(n+1\) nodes

DOI10.1016/0167-6377(92)90075-EzbMath0768.90076MaRDI QIDQ1197890

Alain Prodon

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

polyhedraspanning treeSteiner treeterminalsconnected undirected graph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Related Items (1)

Tree polytope on 2-trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient algorithms for a family of matroid intersection problems
• Steiner problem in networks: A survey
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• A weighted matroid intersection algorithm
• The steiner problem in graphs

This page was built for publication: Steiner trees with \(n\) terminals among \(n+1\) nodes