Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Korte, Bernhard; Vygen, Jens
ISBN 10: 3662560380 ISBN 13: 9783662560389
Published by Springer, 2018
New
Hardcover
From
Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
AbeBooks Seller since March 25, 2015
This specific item is no longer available.
About this Item
Description:
In English. Seller Inventory # ria9783662560389_new
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 torepresent the state of the art of combinatorial optimization.
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.
Bibliographic Details
Title: Combinatorial Optimization: Theory and ...
Publisher: Springer
Publication Date: 2018
Binding: Hardcover
Condition: New
Top Search Results from the AbeBooks Marketplace
Stock Image
Combinatorial Optimization: Theory and Algorithms
Seller: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G3662560380I5N00
Stock Image
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Seller: Books From California, Simi Valley, CA, U.S.A.
Seller rating 5 out of 5 stars
hardcover. Condition: Very Good. Seller Inventory # mon0003865158
Seller Image
Combinatorial Optimization : Theory and Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 30500279
Seller Image
Combinatorial Optimization
Published by
Springer Berlin Heidelberg, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Gebunden. 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 # 178843969
Buy New
US$ 97.64
Shipping:
US$ 57.03
From Germany to U.S.A.
Quantity: Over 20 available
Combinatorial Optimization | Theory and Algorithms
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Combinatorial Optimization | Theory and Algorithms | Jens Vygen (u. a.) | Buch | XXI | Englisch | 2018 | Springer-Verlag GmbH | EAN 9783662560389 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 111047545
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 # ABLIING23Mar3113020317372
Seller Image
Combinatorial Optimization : Theory and Algorithms
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 30500279-n
Seller Image
Combinatorial Optimization : Theory and Algorithms
Published by
Springer Berlin Heidelberg, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783662560389
Seller Image
Combinatorial Optimization
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 2018, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 720 pp. Englisch. Seller Inventory # 9783662560389
Seller Image
Combinatorial Optimization
Published by
Springer Berlin Heidelberg Mrz 2018, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
New
Hardcover
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. 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 # 9783662560389