Steiner Tree Problems in Computer Communication Networks Dingzhu Du y Xiaodong Hu
Tipo de material:
- 978-981-279-144-3
- 004.6 D812s
Contenidos:
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
Tipo de ítem | Biblioteca actual | Signatura topográfica | Copia número | Estado | Código de barras | |
---|---|---|---|---|---|---|
![]() |
Biblioteca Universidad Regional Amazónica Ikiam | 004.6 D812s (Navegar estantería(Abre debajo)) | Ej.1/1 | Disponible | 000465 |
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
No hay comentarios en este titulo.
Iniciar sesión para colocar un comentario.