Combinatorial optimization in system configuration design
Automation and Remote Control
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Constrained low-interference relay node deployment for underwater acoustic wireless sensor networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
An improved approximation algorithm for the terminal Steiner tree problem
ICCSA'11 Proceedings of the 2011 international conference on Computational science and its applications - Volume Part III
KESOSD: keyword search over structured data
KEYS '12 Proceedings of the Third International Workshop on Keyword Search on Structured Data
Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
Theoretical Computer Science
Short communication: Linking habitats for multiple species
Environmental Modelling & Software
On segmenting logistical zones for servicing continuously developed consumers
Automation and Remote Control
Minimum diameter cost-constrained Steiner trees
Journal of Combinatorial Optimization
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
International Journal of Parallel Programming
Hi-index | 0.00 |
The Steiner tree problem is one of the most important combinatorial optimization problems. It has a long history that can be traced back to the famous mathematician Fermat (1601 1665). This book studies three significant breakthroughs on the Steiner tree problem that were achieved in the 1990s, and some important applications of Steiner tree problems in computer communication networks researched in the past fifteen years. It not only covers some of the most recent developments in Steiner tree problems, but also discusses various combinatorial optimization methods, thus providing a balance between theory and practice. Contents: Minimax Approach and Steiner Ratio; k-Steiner Ratios and Better Approximation Algorithms; Geometric Partitions and Polynomial Time Approximation Schemes; Grade of Service Steiner Tree Problem; Steiner Tree Problem for Minimal Steiner Points; Bottleneck Steiner Tree Problem; Steiner k-Tree and k-Path Routing Problems; Steiner Tree Coloring Problem; Steiner Tree Scheduling Problem; Survivable Steiner Network Problem.