Algorithms for the minimum diameter terminal Steiner tree problem

DOI10.1007/S10878-012-9591-7MaRDI QIDQ489734zbMATH OpenOpenAlexWikidataFDO

Authors Wei Ding, Ke Qiu

Publication date 21 January 2015

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-012-9591-7

zbMATH Keywords

dipolarterminal Steiner treemonopolar

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Recommendations

• Minimum Diameter Spanning Trees and Related Problems
• Computing and Combinatorics
• Minimum diameter vertex-weighted Steiner tree
• Diameter-constrained Steiner tree
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem

Cites work

• scientific article; zbMATH DE number 176576 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1947054 (Why is no real title available?)
• scientific article; zbMATH DE number 2119700 (Why is no real title available?)
• A better constant-factor approximation for selected-internal Steiner minimum tree
• A distributed algorithm for constructing a minimum diameter spanning tree
• A note on the terminal Steiner tree problem
• A note on two problems in connexion with graphs
• Algorithms for terminal Steiner trees
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An improved LP-based approximation for Steiner tree
• Approximating the selected-internal Steiner tree
• Approximating the weight of shallow Steiner trees
• Computing a (1+)-approximate geometric minimum-diameter spanning tree
• Minimum Diameter Spanning Trees and Related Problems
• On approximation algorithms for the terminal Steiner tree problem
• On the Internal Steiner Tree Problem
• On the full and bottleneck full Steiner tree problems
• On the minimum diameter spanning tree problem
• On the terminal Steiner tree problem.
• Quicksort
• Steiner tree problems in computer communication networks.
• The Steiner problem with edge lengths 1 and 2
• The full Steiner tree problem

Cited in

(8)

• Minimum diameter \(k\)-Steiner forest
• Computing and Combinatorics
• Minimum diameter vertex-weighted Steiner tree
• A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem
• Algorithms for terminal Steiner trees
• A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs
• Minimum diameter cost-constrained Steiner trees
• Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs

Describes a project that uses

Uses Software

• Quicksort

This page was built for publication: Algorithms for the minimum diameter terminal Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489734)