Approximations for Steiner trees with minimum number of Steiner points
From MaRDI portal
Publication:5927652
DOI10.1023/A:1008384012064zbMath0971.90098MaRDI QIDQ5927652
Guoliang Xue, Guo-Hui Lin, Donghui Chen, Lusheng Wang, Xiao-Dong Hu, Ding-Zhu Du
Publication date: 20 March 2001
Published in: Journal of Global Optimization (Search for Journal in Brave)
approximation algorithmdivision multiplexing optical network designpolynomial time approximation algorithmSteiner tree problemVLSI designwavelengthwireless communications
Related Items (17)
CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS ⋮ A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks ⋮ Spatio-temporal multi-robot routing ⋮ Optimal deployment of indoor wireless local area networks ⋮ Optimal relay location for resource-limited energy-efficient wireless communication ⋮ Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) ⋮ The subdivision-constrained routing requests problem ⋮ The Euclidean bottleneck Steiner path problem and other applications of \((\alpha ,\beta )\)-pair decomposition ⋮ Wireless networking, dominating and packing ⋮ A survey on relay placement with runtime and approximation guarantees ⋮ Approximation algorithms for constructing some required structures in digraphs ⋮ An exact algorithm for minimum CDS with shortest path constraint in wireless networks ⋮ The Euclidean bottleneck full Steiner tree problem ⋮ Improving construction for connected dominating set with Steiner tree in wireless sensor networks ⋮ Approximation algorithms for constructing required subgraphs using stock pieces of fixed length ⋮ Relay placement for two-connectivity ⋮ An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane
This page was built for publication: Approximations for Steiner trees with minimum number of Steiner points
