Minimum diameter vertex-weighted Steiner tree

DOI10.1007/978-3-030-57602-8_6zbMath1482.68173OpenAlexW3047993683MaRDI QIDQ2039644

Ke Qiu, Wei Ding

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_6

zbMATH Keywords

approximationdiameterSteiner treevertex-weighted graph

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for the minimum diameter terminal Steiner tree problem
• On the minimum diameter spanning tree problem
• The Steiner tree problem
• Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
• A distributed algorithm for constructing a minimum diameter spanning tree
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
• Minimum diameter cost-constrained Steiner trees
• DIAMETER-CONSTRAINED STEINER TREES
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• Minimum Diameter Spanning Trees and Related Problems
• Bicriteria Network Design Problems

This page was built for publication: Minimum diameter vertex-weighted Steiner tree