Steiner Tree Problems in Computer Communication Networks
Du, Dingzhu
Steiner Tree Problems in Computer Communication Networks Dingzhu Du y Xiaodong Hu - Estados Unidos World Scientific 2008 - 359 P. graf. 22.7 cm.
Fundamentals of Classical Steiner Tree Problem - Geometric Partitions and Polynomial Time Approximation Schemes - Grade of Service Steiner Tree Problem - Bottleneck Steiner Tree Peoblem - Steiner k-Tree and k-Path Routing Problems - Steiner Tree Coloring Problem - Survivable Steiner Network Problem
978-981-279-144-3
STEINER SYSTEMS \\ COMPUTER NETWORKSÌ
004.6 / D812s
Steiner Tree Problems in Computer Communication Networks Dingzhu Du y Xiaodong Hu - Estados Unidos World Scientific 2008 - 359 P. graf. 22.7 cm.
Fundamentals of Classical Steiner Tree Problem - Geometric Partitions and Polynomial Time Approximation Schemes - Grade of Service Steiner Tree Problem - Bottleneck Steiner Tree Peoblem - Steiner k-Tree and k-Path Routing Problems - Steiner Tree Coloring Problem - Survivable Steiner Network Problem
978-981-279-144-3
STEINER SYSTEMS \\ COMPUTER NETWORKSÌ
004.6 / D812s