Bottleneck Steiner tree with bounded number of Steiner vertices
From MaRDI portal
Publication:2253907
DOI10.1016/j.jda.2014.12.004zbMath1320.68225OpenAlexW2125311247MaRDI QIDQ2253907
Paz Carmi, A. Karim Abu-Affash, Matthew J. Katz
Publication date: 13 February 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2014.12.004
Analysis of algorithms and problem complexity (68Q25) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- The Steiner tree problem
- The partial sum criterion for Steiner trees in graphs and shortest paths
- Approximations for a bottleneck Steiner tree problem
- New approximation algorithms for the Steiner tree problems
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- Advances in Steiner trees
- An improved LP-based approximation for steiner tree
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- The Rectilinear Steiner Tree Problem is $NP$-Complete
- The Complexity of Computing Steiner Minimal Trees
- Improved Approximations for the Steiner Tree Problem
- Thek-Steiner Ratio in Graphs
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- Tighter Bounds for Graph Steiner Tree Approximation
- Bottleneck Steiner trees in the plane
- On the euclidean bottleneck full Steiner tree problem
- The euclidean bottleneck steiner path problem
This page was built for publication: Bottleneck Steiner tree with bounded number of Steiner vertices
