scientific article; zbMATH DE number 1796993

MaRDI QIDQ4551389zbMATH OpenFDO

Authors Du Ding-Zhu, Lusheng Wang, Baogang Xu

Publication date 5 September 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2108/21080509

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

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

Cited in

(12)

• Algorithms for connected set cover problem and fault-tolerant connected set cover problem
• Optimal and approximate bottleneck Steiner trees
• An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
• Wireless networking, dominating and packing
• Bottleneck Steiner tree with bounded number of Steiner vertices
• Euclidean Steiner trees optimal with respect to swapping 4-point subtrees
• On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
• Improving construction for connected dominating set with Steiner tree in wireless sensor networks
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• Approximating Steiner trees and forests with minimum number of Steiner points
• Approximation algorithms for constructing Steiner trees in the Euclidean plane \(\mathbb{R}^2\) using stock pieces of materials with fixed length
• On the minimum number of Steiner points of constrained 1-line-fixed Steiner tree in the Euclidean plane \(\mathbb{R}^2\)

This page was built for publication:

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