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 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 to represent the state of the art of combinatorial optimization.
"synopsis" may belong to another edition of this title.
About the Author
Bernhard Korte is professor of operations research and director of the Research Institute for Discrete Mathematics at the University of Bonn. He founded the Arithmeum in Bonn and received numerous awards, including a honorary doctoral degree and the "Staatspreis NRW". His research interests include combinatorial optimization and chip design.
Jens Vygen is professor of discrete mathematics at the University of Bonn and principal investigator of the Hausdorff Center for Mathematics. He also co-authored the textbook “Algorithmic Mathematics” and has served as editor of several books and journals. His research interests include combinatorial optimization and algorithms for chip design.
"About this title" may belong to another edition of this title.
- PublisherSpringer
- Publication date2019
- ISBN 10 3662585669
- ISBN 13 9783662585665
- BindingPaperback
- Number of pages719
- Rating
Buy New
Learn more about this copy
US$ 71.03
Shipping:
FREE
Within U.S.A.
Top Search Results from the AbeBooks Marketplace
Seller Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics (21)) by Korte, Bernhard, Vygen, Jens [Paperback ]
Seller: booksXpress, Bayonne, NJ, U.S.A.
Seller rating 4 out of 5 stars
Soft Cover. Condition: new. Seller Inventory # 9783662585665
Quantity: 10 available
Stock Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020317949
Quantity: Over 20 available
Stock Image
Combinatorial Optimization : Theory and Algorithms
Print on DemandSeller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9783662585665_lsuk
Quantity: Over 20 available
Stock Image
Combinatorial Optimization: Theory and Algorithms
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: New. Seller Inventory # 26375862243
Quantity: 1 available
Stock Image
Combinatorial Optimization : Theory and Algorithms
Seller: Chiron Media, Wallingford, United Kingdom
Seller rating 5 out of 5 stars
PF. Condition: New. Seller Inventory # 6666-IUK-9783662585665
Quantity: 10 available
Stock Image
Combinatorial Optimization: Theory and Algorithms
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 370183228
Quantity: 1 available
Stock Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics (21))
Seller: Russell Books, Victoria, BC, Canada
Seller rating 5 out of 5 stars
Paperback. Condition: New. Special order direct from the distributor Softcover reprint of the original 6th ed. 2018. Seller Inventory # ING9783662585665
Quantity: Over 20 available
Seller Image
Combinatorial Optimization
Published by
Springer Berlin Heidelberg Jan 2019, 2019
ISBN 10: 3662585669
ISBN 13: 9783662585665
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, 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 numerousexercises 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 to represent the state of the art of combinatorial optimization. 720 pp. Englisch. Seller Inventory # 9783662585665
Quantity: 2 available
Seller Image
Combinatorial Optimization : Theory and Algorithms
Published by
Springer Berlin Heidelberg, 2019
ISBN 10: 3662585669
ISBN 13: 9783662585665
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This comprehensive textbook on combinatorial optimization places specialemphasis on theoretical results and algorithms with provably goodperformance, 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 numerousexercises 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. Seller Inventory # 9783662585665
Quantity: 1 available
Seller Image
Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2019
ISBN 10: 3662585669
ISBN 13: 9783662585665
New
Kartoniert / Broschiert
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Kartoniert / Broschiert. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Well-written, popular textbook on combinatorial optimization One of very few textbooks on this topic Subject area has manifold applications Offers complete but concise proofs, making it an invaluable practical tool for students . Seller Inventory # 449139730
Quantity: Over 20 available