Items related to Combinatorial Optimization: Theory and Algorithms (Algorithm...
Synopsis
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.
"synopsis" may belong to another edition of this title.
Review
From the reviews of the fifth edition:
“The book would be most suitable as a graduate text for a mathematics or computer science course. It offers a good number of exercises ... . This book excels at providing very up-to-date results that give an idea of the state of the art, but also makes it clear that this is still a very active area of research. Overall, it is a comprehensive and interesting text that manages to present both the most classical and the most recent ideas in the field.” (Angele M. Hamel, ACM Computing Reviews, August, 2012)
“This is the 5th edition of one of the standard books in 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. ... ‘Combinatorial Optimization’ can easily serve as ... complete reference for current research and is state-of-the-art. In this new edition references have been updated and new exercises were added.” (Sebastian Pokutta, Zentralblatt MATH, Vol. 1237, 2012)
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2012
- ISBN 10 3642244874
- ISBN 13 9783642244872
- BindingHardcover
- Edition number5
- Number of pages660
- Rating
Top Search Results from the AbeBooks Marketplace
Stock Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
Seller: HPB-Red, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: USED_GOOD. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!. Seller Inventory # S_329507871
Quantity: 1 available
Stock Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
Seller: Books Unplugged, Amherst, NY, U.S.A.
Seller rating 5 out of 5 stars
Condition: USED_GOOD. Buy with confidence! Book is in good condition with minor wear to the pages, binding, and minor marks within 2.51. Seller Inventory # bk3642244874xvz189zvxgdd
Quantity: 1 available
Stock Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)
Seller: GF Books, Inc., Hawthorne, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: USED_VERYGOOD. Book is in Used-VeryGood condition. Pages and cover are clean and intact. Used items may not include supplementary materials such as CDs or access codes. May show signs of minor shelf wear and contain very limited notes and highlighting. 2.51. Seller Inventory # 3642244874-2-3
Quantity: 1 available