Approximations for a bottleneck Steiner tree problem

Recommendations

An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
On the Euclidean bottleneck full Steiner tree problem
Optimal and approximate bottleneck Steiner trees
Approximations for Steiner trees with minimum number of Steiner points
The Euclidean bottleneck full Steiner tree problem

Cited in

(22)

Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
Bottleneck Steiner tree with bounded number of Steiner vertices
The Euclidean bottleneck full Steiner tree problem
Optimal relay location for resource-limited energy-efficient wireless communication
The Euclidean bottleneck Steiner path problem and other applications of ( , )-pair decomposition
scientific article; zbMATH DE number 1688388 (Why is no real title available?)
Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees
On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem
The bottleneck 2-connected k-Steiner network problem for k 2
The bottleneck selected‐internal and partial terminal Steiner tree problems
scientific article; zbMATH DE number 1424548 (Why is no real title available?)
Computational Science and Its Applications – ICCSA 2004
Fixed parameter tractability of a biconnected bottleneck Steiner network problem
Simplifying obstacles for Steiner network problems in the plane
Exact algorithms for the bottleneck Steiner tree problem
An exact algorithm for the line-constrained bottleneck \(k\)-Steiner tree problem
Approximation algorithms for constructing Steiner trees in the Euclidean plane \(\mathbb{R}^2\) using stock pieces of materials with fixed length
On exact solutions to the Euclidean bottleneck Steiner tree problem
The approximability of three-dimensional assignment problems with bottleneck objective
Survivable minimum bottleneck networks
An exact algorithm for the bottleneck 2-connected k-Steiner network problem in L_p planes

This page was built for publication: Approximations for a bottleneck Steiner tree problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348905)