On exact solutions to the Euclidean bottleneck Steiner tree problem

@article{Bae2009OnES,
  title={On exact solutions to the Euclidean bottleneck Steiner tree problem},
  author={Sang Won Bae and Chunseok Lee and Sunghee Choi},
  journal={Inf. Process. Lett.},
  year={2009},
  volume={110},
  pages={672-678}
}

Figures from this paper

Fast Approximation Algorithm for Restricted Euclidean Bottleneck Steiner Tree Problem

TLDR
It is shown that the bottleneck Steiner tree problem is NP-hard and cannot be approximated within unless P=NP, and a fast polynomial time deterministic approximation algorithm with performance ratio is provided.

Exact Algorithms for the Bottleneck Steiner Tree

TLDR
This paper presents the first fixed-parameter tractable al- gorithm running in O(f(k) · n 2 log n) time for the L1 and the L∞ metrics, and the first exact algorithm for any other Lp metric with 1 <p< ∞ whose time complexity is O( f( k) ·(n k +nlog n)) ,w heref(K) is a function dependent only on k.

Exact Algorithms for the Bottleneck Steiner Tree Problem

TLDR
This paper presents the first fixed-parameter tractable algorithm running in f(k)⋅nlog 2n time for the L1 and the L∞ metrics, and the first exact algorithm for theLp metric for any fixed rational p with 1<p<∞ whose time complexity is f( k) ⋅(nk+nlog n), where f(K) is a function dependent only on k.

Nearly Optimal Solution for Restricted Euclidean Bottleneck Steiner Tree Problem

TLDR
A restricted version of the bottleneck Steiner tree problem in the Euclidean plane which requires that only degree-2 Steiner points are possibly adjacent in the optimal solution is studied.

On the euclidean bottleneck full Steiner tree problem

TLDR
This paper presents an exact algorithm of O((n+m)log2m) time to solve the BFST problem and shows that the k-BFST problem is NP-hard and that there exists a polynomial-time approximation algorithm for the problem with performance ratio 4.

Generalised k-Steiner Tree Problems in Normed Planes

TLDR
This paper generalises Georgakopoulos and Papadimitriou's approach in order to solve the k-Steiner tree problem, in which the Steiner minimum tree may contain up to k Steiner points for a given constant k, and shows that, for any fixed k, such problems can be solved in O(n2k) time.

The euclidean bottleneck steiner path problem

TLDR
An O(n log<sup>2</sup> n)-time algorithm that computes an optimal solution, for any constant k, based on two new geometric structures that are based on an (α,β)-pair decomposition of P and a floor (1+ε)-spanner of P.

The Euclidean Bottleneck Full Steiner Tree Problem

TLDR
It is shown that the k-BFST problem is NP-hard and that there exists a polynomial-time approximation algorithm for the problem with performance ratio 4.5 and an exact algorithm of ${{{\mathcal {O}}}}((n+m)\log^{2}{m})$ time to solve the BFST problem.

References

SHOWING 1-10 OF 17 REFERENCES

Exact Algorithms for the Bottleneck Steiner Tree Problem

TLDR
This paper presents the first fixed-parameter tractable algorithm running in f(k)⋅nlog 2n time for the L1 and the L∞ metrics, and the first exact algorithm for theLp metric for any fixed rational p with 1<p<∞ whose time complexity is f( k) ⋅(nk+nlog n), where f(K) is a function dependent only on k.

Approximation algorithm for bottleneck Steiner tree problem in the Euclidean plane

TLDR
The special case of the bottleneck Steiner tree problem in the Euclidean plane is proved to beNP-hard and cannot be approximated within ratio √2.

Optimal and approximate bottleneck Steiner trees

An approximation algorithm for a bottleneck k-Steiner tree problem in the Euclidean plane

Bottleneck Steiner Trees in the Plane

TLDR
It is shown that when locations of Steiner points are not fixed the problem remains NP-complete; however, if the topology of the final tree is given, then the problem can be solved in Theta ( mod rho mod log mod r ho mod ) time.

Approximations for a Bottleneck Steiner Tree Problem

TLDR
It is shown that if NP is NP-hard, then there exists a polynomial-time approximation with performance ratio 2 for the problem in both the rectilinear plane and the Euclidean plane.

On Two Geometric Problems Related to the Traveling Salesman Problem

A powerful global router: based on Steiner min-max trees

TLDR
A study is made of the global routing of multiterminal nets, and an efficient algorithm is presented for obtaining a Steiner min-max tree, in a weighted graph.

The Farthest Color Voronoi Diagram and Related Problems

TLDR
This paper provides algorithms that may help to achieve this goal for various specifications of the term “neighborhood” for various types of facilities modeled by n colored points in the plane, each type by its own color.

The upper envelope of voronoi surfaces and its applications

TLDR
Borders on the number of vertices on the upper envelope of a collection of Voronoi surfaces are derived, and efficient algorithms to calculate these vertices are provided.