Steiner tree problem with minimum number of Steiner points and bounded edge-length
From MaRDI portal
Publication:294609
DOI10.1016/S0020-0190(98)00201-4zbMath1339.68209MaRDI QIDQ294609
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098002014?np=y
VLSI design; wireless communications; approximation algorithms; Steiner minimum trees; WDM optimal networks
68R10: Graph theory (including graph drawing) in computer science
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68W25: Approximation algorithms
Related Items
Approximations for Steiner trees with minimum number of Steiner points, Wire segmenting for buffer insertion based on RSTP-MSP, Improved approximation algorithms for single-tiered relay placement, Optimal relay node placement in delay constrained wireless sensor network design, Approximations for constructing tree-form structures using specific material with fixed length, Relay placement for fault tolerance in wireless networks in higher dimensions, Recovery from multiple simultaneous failures in wireless sensor networks using minimum Steiner tree, Spatio-temporal multi-robot routing, Algorithms for connected set cover problem and fault-tolerant connected set cover problem, An approximation algorithm for a bottleneck \(k\)-Steiner tree problem in the Euclidean plane, A note on the MST heuristic for bounded edge-length Steiner trees with minimum number of Steiner points, Approximation algorithms for constructing specific subgraphs with minimum number of length-bounded stock pieces, Wireless networking, dominating and packing, Approximation algorithms for constructing required subgraphs using stock pieces of fixed length, Approximation algorithms for constructing some required structures in digraphs, The Euclidean bottleneck full Steiner tree problem, Relay placement for two-connectivity, 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, Improving construction for connected dominating set with Steiner tree in wireless sensor networks, Combination algorithms for Steiner tree variants, CONSTRAINED RELAY NODE DEPLOYMENT FOR UNDERWATER ACOUSTIC WIRELESS SENSOR NETWORKS, Approximating minimum Steiner point trees in Minkowski planes, A Sensor Deployment Strategy in Bus-Based Hybrid Ad-Hoc Networks
Cites Work
