Tell your friends about this item:
Steiner Tree Problems In Computer Communication Networks Du, Ding-zhu (Univ Of Texas At Dallas, Usa)
Do you have a profile? Log in
Get notified about new Du, Ding-zhu (Univ Of Texas At Dallas, Usa) releases
Add to your iMusic wish list
Steiner Tree Problems In Computer Communication Networks
Du, Ding-zhu (Univ Of Texas At Dallas, Usa)
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 (1601A-1665). This book studies some of the applications of Steiner tree problems in computer communication networks, which have been discovered and studied extensively.
370 pages, illustrations
| Media | Books Hardcover Book (Book with hard spine and cover) |
| Released | February 25, 2008 |
| ISBN13 | 9789812791443 |
| Publishers | World Scientific Publishing Co Pte Ltd |
| Pages | 376 |
| Dimensions | 161 × 235 × 25 mm · 656 g |