Exact algorithms for the bottleneck Steiner tree problem
DOI10.1007/S00453-011-9553-YzbMATH Open1230.68203OpenAlexW2144383545MaRDI QIDQ652535FDOQ652535
Authors: Sang Won Bae, Chunseok Lee, Shin-Ichi Tanigawa, Sung Hee Choi 
Publication date: 14 December 2011
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-011-9553-y
Recommendations
- Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
- Optimal and approximate bottleneck Steiner trees
- On the full and bottleneck full Steiner tree problems
optimizationcomputational geometryexact algorithmfixed-parameter tractabilitySteiner pointbottleneck Steiner tree
Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Research Problems in Discrete Geometry
- Voronoi diagram for services neighboring a highway
- Title not available (Why is that?)
- Solving zero-dimensional systems through the rational univariate representation
- The upper envelope of Voronoi surfaces and its applications
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Slowing down sorting networks to obtain faster sorting algorithms
- Sorting in \(c \log n\) parallel steps
- Title not available (Why is that?)
- Solving polynomial equations. Foundations, algorithms, and applications
- On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
- Approximations for a bottleneck Steiner tree problem
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- Parametric search made practical
- Title not available (Why is that?)
- An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
- Optimal and approximate bottleneck Steiner trees
- An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
- A survey on the complexity of solving algebraic systems
- The Kissing Numbers of Convex Bodies - A Brief Survey
Cited In (11)
- On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
- On the restricted \(k\)-Steiner tree problem
- On exact solutions to the Euclidean bottleneck Steiner tree problem
- Fixed parameter tractability of a biconnected bottleneck Steiner network problem
- An exact algorithm for the bottleneck 2-connected \(k\)-Steiner network problem in \(L_p\) planes
- An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
- An exact branch and bound algorithm for the Steiner Problem in Graphs
- Simplifying obstacles for Steiner network problems in the plane
- Exact algorithms for the bottleneck Steiner tree problem (extended abstract)
- Survivable minimum bottleneck networks
- Generalised \(k\)-Steiner tree problems in normed planes
Uses Software
This page was built for publication: Exact algorithms for the bottleneck Steiner tree problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q652535)
