Dingzhu Du,
Xiaodong Hu
STEINER TREE PROBLEMS IN COMPUTER COMMUNICATION NETWORKS
Gebonden Engels 2008 9789812791443Levertijd ongeveer 11 werkdagen
Gratis verzonden
Samenvatting
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.
Specificaties
ISBN13:9789812791443
Taal:Engels
Bindwijze:Gebonden
Aantal pagina's:376
Uitgever:World Scientific Publishing Co Pte Ltd
Lezersrecensies
Wees de eerste die een lezersrecensie schrijft!
Inhoudsopgave
Fundamentals of Classical Steiner Tree Problem; Steiner Tree Problem with Bounded Component Sizes; Steiner Tree Problem under Given Topologies; Steiner Tree Problem for Minimal Number of Steiner Points; Bottleneck Steiner Tree Problem; Terminal Steiner Tree Problem; Steiner Tree Problem with Grade of Services; Survivable Steiner Network Problem.
Rubrieken
- advisering
- algemeen management
- coaching en trainen
- communicatie en media
- economie
- financieel management
- inkoop en logistiek
- internet en social media
- it-management / ict
- juridisch
- leiderschap
- marketing
- mens en maatschappij
- non-profit
- ondernemen
- organisatiekunde
- personal finance
- personeelsmanagement
- persoonlijke effectiviteit
- projectmanagement
- psychologie
- reclame en verkoop
- strategisch management
- verandermanagement
- werk en loopbaan