Steiner Tree Problems in Computer Communication Networks
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.
CHF 171.00
Preise inkl. MwSt. und Versandkosten (Portofrei ab CHF 40.00)
V106:
Fremdlagertitel. Lieferzeit unbestimmt
Produktdetails
Weitere Autoren: Hu, Xiaodong
- ISBN: 978-981-279-144-3
- EAN: 9789812791443
- Produktnummer: 3531399
- Verlag: World Scientific Pub Co Inc
- Sprache: Englisch
- Erscheinungsjahr: 2008
- Seitenangabe: 359 S.
- Masse: H23.5 cm x B15.3 cm x D2.6 cm 667 g
- Gewicht: 667
76 weitere Werke von Ding-Zhu Du:
Bewertungen
Anmelden