teweepreli.ga | Combinatorial Optimization | | Bernhard Korte | Boeken
If you do not have to customize your Internet security settings, click Default Level. Then go to step 5.
Prices and offers may vary in store. Select Parent Grandparent Teacher Kid at heart. Age of the child I gave this to:. Hours of Play:.
Combinatorial Optimization Theory and Algorithms
Tell Us Where You Are:. Preview Your Review.
- Metal Complexes with Tetrapyrrole Ligands II!
- The theory of convex extensions in combinatorial optimization problems.
- Educating children with autism;
- BE THE FIRST TO KNOW!
Thank you. Your review has been submitted and will appear here shortly.
Extra Content. Table of Contents 1 Introduction.
Recommended for you
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. Thus, this book continues to represent the state of the art of combinatorial optimization. It is an excellent book covering everything from the basics up to the most advanced topics graduate level and current research.
It provides theoretical results, underlying ideas, algorithms and the needed basics in graph theory in a very nice, comprehensive way. The book also provides insights into and pointers to adjacent areas that could not be covered in full length for the interested reader. Back to search.
Related Combinatorial Optimization Theory and Algorithms
Copyright 2019 - All Right Reserved