Algorithms for the minimum diameter terminal Steiner tree problem

DOI10.1007/S10878-012-9591-7zbMATH Open1314.90081OpenAlexW1963695813WikidataQ62043101 ScholiaQ62043101MaRDI QIDQ489734FDOQ489734

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

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

zbMATH Keywords

dipolarterminal Steiner treemonopolar

Mathematics Subject Classification ID

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

Cites Work

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

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

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)