SØG - mellem flere end 8 millioner bøger:
Viser: Combinatorial Optimization - Theory and Algorithms
Combinatorial Optimization Vital Source e-bog
Bernhard Korte og Jens Vygen
(2018)
Combinatorial Optimization
Theory and Algorithms
Bernhard Korte og Jens Vygen
(2018)
Sprog: Engelsk
Detaljer om varen
- 6. Udgave
- Vital Source 365 day rentals (dynamic pages)
- Udgiver: Springer Nature (Marts 2018)
- Forfattere: Bernhard Korte og Jens Vygen
- ISBN: 9783662560396R365
Online udgaven er tilgængelig: 365 dage fra købsdato.
Offline udgaven er tilgængelig: 365 dage fra købsdato.
Udgiveren oplyser at følgende begrænsninger er gældende for dette produkt:
Print: 2 sider kan printes ad gangen
Copy: højest 2 sider i alt kan kopieres (copy/paste)
Detaljer om varen
- 6. Udgave
- Hardback: 698 sider
- Udgiver: Springer Berlin / Heidelberg (Marts 2018)
- Forfattere: Bernhard Korte og Jens Vygen
- ISBN: 9783662560389
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.


