SØG - mellem flere end 8 millioner bøger:
Viser: Combinatorial Optimization - Theory and Algorithms
Combinatorial Optimization
Theory and Algorithms
Bernhard Korte og Jens Vygen
(2012)
Sprog: Engelsk
Detaljer om varen
- 5. Udgave
- Hardback
- Udgiver: Springer London, Limited (Januar 2012)
- Forfattere: Bernhard Korte og Jens Vygen
- ISBN: 9783642244872
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 fifth edition has again been updated, revised, and significantly extended, with more than 60 new exercises and new material on various topics, including Cayley's formula, blocking flows, faster b-matching separation, multidimensional knapsack, multicommodity max-flow min-cut ratio, and sparsest cut. Thus, this book represents the state of the art of combinatorial optimization.
Handler du som firma
Forretningsbetingelser
Porto og forsendelse
Data & cookiepolitik
Tlf 77 42 43 44 - email poly@polyteknisk.dk - CVR 34072655 - Sydbank Reg: 6748 Konto 0001107927