Exact algorithms for the bottleneck Steiner tree problem

DOI10.1007/S00453-011-9553-YMaRDI QIDQ652535zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

optimizationcomputational geometryexact algorithmfixed-parameter tractabilitySteiner pointbottleneck Steiner tree

Mathematics Subject Classification ID

Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

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

Cites work

• scientific article; zbMATH DE number 4214184 (Why is no real title available?)
• scientific article; zbMATH DE number 1424547 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• A survey on the complexity of solving algebraic systems
• An Optimal Algorithm for Scanning All Spanning Trees of Undirected Graphs
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Approximations for a bottleneck Steiner tree problem
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles
• Optimal and approximate bottleneck Steiner trees
• Parametric search made practical
• Research Problems in Discrete Geometry
• Slowing down sorting networks to obtain faster sorting algorithms
• Solving polynomial equations. Foundations, algorithms, and applications
• Solving zero-dimensional systems through the rational univariate representation
• Sorting in \(c \log n\) parallel steps
• The Kissing Numbers of Convex Bodies - A Brief Survey
• The upper envelope of Voronoi surfaces and its applications
• Voronoi diagram for services neighboring a highway

Cited in

(11)

• On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
• On exact solutions to the Euclidean bottleneck Steiner tree problem
• On the restricted \(k\)-Steiner tree problem
• An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes
• Fixed parameter tractability of a biconnected bottleneck Steiner network problem
• An exact branch and bound algorithm for the Steiner Problem in Graphs
• An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
• 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

Describes a project that uses

Uses Software

• ISOLATE

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)