| 000 | 00896nam a2200193Ia 4500 | ||
|---|---|---|---|
| 005 | 20160802125056.0 | ||
| 008 | 160422e2008 u d 000 0 e d | ||
| 020 | _a978-981-279-144-3 | ||
| 040 | _aB-IKIAM | ||
| 041 | _aENG | ||
| 082 |
_a004.6 _bD812s |
||
| 100 | _aDu, Dingzhu | ||
| 245 |
_aSteiner Tree Problems in Computer Communication Networks _c Dingzhu Du y Xiaodong Hu |
||
| 260 |
_aEstados Unidos _bWorld Scientific _c2008 |
||
| 300 |
_a359 P. _bgraf. _c22.7 cm. |
||
| 505 | _aFundamentals 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 | ||
| 650 | _aSTEINER SYSTEMS \\ COMPUTER NETWORKSĂ | ||
| 942 |
_2ddc _aB-IKIAM _b02-08-2016 _cBK _zBety Vasco |
||
| 999 |
_c1035 _d1035 |
||