Graphs, Networks and Algorithms
Seiten
2004
|
2., Ed.
Springer Berlin (Verlag)
978-3-540-21905-7 (ISBN)
Springer Berlin (Verlag)
978-3-540-21905-7 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
Zu diesem Artikel existiert eine Nachauflage
From the reviews of the first edition:
".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..."
Mathematical Reviews 2002
This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.
".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..."
Mathematical Reviews 2002
This thoroughly revised new edition offers a new chapter on the network simplex algorithm and a section on the five color theorem. Moreover, numerous smaller changes and corrections have been made and several recent developments have been discussed and referenced.
| Reihe/Serie | Algorithms and Computation in Mathematics ; 5 |
|---|---|
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 1060 g |
| Einbandart | gebunden |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik |
| Schlagworte | Algorithmen • algorithms • Complexity theory • Graph • Graphen • HC/Informatik, EDV/Informatik • HC/Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik • Netzwerke • optimzation • theory |
| ISBN-10 | 3-540-21905-6 / 3540219056 |
| ISBN-13 | 978-3-540-21905-7 / 9783540219057 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Erfolg und Spaß im Horrorfach nichttechnischer Studiengänge
Buch | Softcover (2023)
Springer Spektrum (Verlag)
39,99 €
Eine Einführung in die faszinierende Welt des Zufalls
Buch | Softcover (2024)
Springer Spektrum (Verlag)
39,99 €
