Combinatorial Optimization
Produktnummer:
188339f7e2652d495aa2b907cb0a062bfd
| Autor: | Korte, Bernhard Vygen, Jens |
|---|---|
| Themengebiete: | approximation algorithms combinatorial optimization discrete algorithms graphs integer linear programming matching mathematical programming matroids network design network flows |
| Veröffentlichungsdatum: | 23.03.2018 |
| EAN: | 9783662560389 |
| Auflage: | 6 |
| Sprache: | Englisch |
| Seitenzahl: | 698 |
| Produktart: | Gebunden |
| Verlag: | Springer Berlin |
| Untertitel: | Theory and Algorithms |
Produktinformationen "Combinatorial Optimization"
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+?)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.
Sie möchten lieber vor Ort einkaufen?
Sie haben Fragen zu diesem oder anderen Produkten oder möchten einfach gerne analog im Laden stöbern? Wir sind gerne für Sie da und beraten Sie auch telefonisch.
Juristische Fachbuchhandlung
Georg Blendl
Parcellistraße 5 (Maxburg)
8033 München
Montag - Freitag: 8:15 -18 Uhr
Samstags geschlossen