Algorithms for the minimum diameter terminal Steiner tree problem
From MaRDI portal
Publication:489734
DOI10.1007/s10878-012-9591-7zbMath1314.90081OpenAlexW1963695813WikidataQ62043101 ScholiaQ62043101MaRDI QIDQ489734
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
Related Items (5)
A sifting-edges algorithm for accelerating the computation of absolute 1-center in graphs ⋮ Approximating the asymmetric \(p\)-center problem in parameterized complete digraphs ⋮ A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Minimum diameter vertex-weighted Steiner tree
Uses Software
Cites Work
- A note on two problems in connexion with graphs
- On the minimum diameter spanning tree problem
- The full Steiner tree problem
- A better constant-factor approximation for selected-internal Steiner minimum tree
- Approximating the selected-internal Steiner tree
- A note on the terminal Steiner tree problem
- On approximation algorithms for the terminal Steiner tree problem
- The Steiner problem with edge lengths 1 and 2
- Approximating the weight of shallow Steiner trees
- On the terminal Steiner tree problem.
- Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree
- A distributed algorithm for constructing a minimum diameter spanning tree
- Algorithms for terminal Steiner trees
- An improved LP-based approximation for steiner tree
- On the Full and Bottleneck Full Steiner Tree Problems
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Minimum Diameter Spanning Trees and Related Problems
- On the Internal Steiner Tree Problem
- Quicksort
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algorithms for the minimum diameter terminal Steiner tree problem
