Steiner's problem in double trees

DOI10.1016/S0893-9659(02)00053-8zbMath1009.05040OpenAlexW2054725215MaRDI QIDQ1861809

W. Fitch, Andreas W. M. Dress, Dietmar Cieslik

Publication date: 10 March 2003

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0893-9659(02)00053-8

zbMATH Keywords

dynamic programmingdiscrete optimizationSteiner minimal treesSMTmost parsimonious treesSteiner's problemdouble trees optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm to construct a rectilinear Steiner minimal tree for \(k\)-extremal point sets
• The Steiner tree problem
• Steiner minimal trees
• Embedding complexity and discrete optimization. I: A new divide and conquer approach to discrete optimization
• Advances in Steiner trees
• Steiner trees, partial 2–trees, and minimum IFI networks
• Generalized steiner problem in series-parallel networks
• Steiner problem in networks: A survey
• Rectilinear steiner trees: Efficient special-case algorithms
• The Complexity of Computing Steiner Minimal Trees
• Thirty‐five‐point rectilinear steiner minimal trees in a day
• On Steiner’s Problem with Rectilinear Distance
• Steiner's problem in graphs and its implications
• The steiner problem in graphs

This page was built for publication: Steiner's problem in double trees