Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)

Korte, Bernhard; Vygen, Jens

  • 4.28 out of 5 stars
    18 ratings by Goodreads
ISBN 10: 3662585669 ISBN 13: 9783662585665
Published by Springer, 2019
New Soft cover

From Ria Christie Collections, Uxbridge, United Kingdom Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since March 25, 2015

This specific item is no longer available.

About this Item

Description:

In. Seller Inventory # ria9783662585665_new

  • 4.28 out of 5 stars
    18 ratings by Goodreads

Report this item

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: 2019
Binding: Soft cover
Condition: New

Top Search Results from the AbeBooks Marketplace

Stock Image

Korte, Bernhard,Vygen, Jens
Published by Springer, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
Used paperback

Seller: Books From California, Simi Valley, CA, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

paperback. Condition: Very Good. Seller Inventory # mon0003842188

Contact seller

Buy Used

US$ 43.95
Shipping: US$ 4.99
Within U.S.A.

Quantity: 1 available

Add to basket

Stock Image

Korte, Bernhard,Vygen, Jens
Published by Springer, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
Used paperback

Seller: HPB-Red, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

paperback. Condition: 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_424883088

Contact seller

Buy Used

US$ 45.31
Shipping: US$ 3.75
Within U.S.A.

Quantity: 1 available

Add to basket

Seller Image

Bernhard Korte|Jens Vygen
Published by Springer Berlin Heidelberg, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Softcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Well-written, popular&nbsptextbook 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

Contact seller

Buy New

US$ 71.93
Shipping: US$ 56.97
From Germany to U.S.A.

Quantity: Over 20 available

Add to basket

Seller Image

Jens Vygen (u. a.)
Published by Springer, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Taschenbuch

Seller: preigu, Osnabrück, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Taschenbuch. Condition: Neu. Combinatorial Optimization | Theory and Algorithms | Jens Vygen (u. a.) | Taschenbuch | xxi | Englisch | 2019 | Springer | EAN 9783662585665 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 115522625

Contact seller

Buy New

US$ 74.79
Shipping: US$ 81.40
From Germany to U.S.A.

Quantity: 5 available

Add to basket

Stock Image

Korte, Bernhard; Vygen, Jens
Published by Springer, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Softcover

Seller: Lucky's Textbooks, Dallas, TX, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # ABLIING23Mar3113020317949

Contact seller

Buy New

US$ 75.80
Shipping: US$ 3.99
Within U.S.A.

Quantity: Over 20 available

Add to basket

Seller Image

Korte, Bernhard; Vygen, Jens
Published by Springer, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Softcover

Seller: GreatBookPrices, Columbia, MD, U.S.A.

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 35120535-n

Contact seller

Buy New

US$ 77.14
Shipping: US$ 2.64
Within U.S.A.

Quantity: Over 20 available

Add to basket

Stock Image

Bernhard Korte, Jens Vygen
Published by Springer 2019-01-11, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Paperback

Seller: Chiron Media, Wallingford, United Kingdom

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Paperback. Condition: New. Seller Inventory # 6666-IUK-9783662585665

Contact seller

Buy New

US$ 80.28
Shipping: US$ 20.61
From United Kingdom to U.S.A.

Quantity: 10 available

Add to basket

Seller Image

Korte, Bernhard; Vygen, Jens
Published by Springer, 2019
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Softcover

Seller: GreatBookPricesUK, Woodford Green, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Seller Inventory # 35120535-n

Contact seller

Buy New

US$ 81.24
Shipping: US$ 19.95
From United Kingdom to U.S.A.

Quantity: Over 20 available

Add to basket

Seller Image

Jens Vygen
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 5-star rating, Learn more about seller ratings

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

Contact seller

Buy New

US$ 83.29
Shipping: US$ 76.00
From Germany to U.S.A.

Quantity: 1 available

Add to basket

Seller Image

Jens Vygen
ISBN 10: 3662585669 ISBN 13: 9783662585665
New Taschenbuch
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

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

Contact seller

Buy New

US$ 83.29
Shipping: US$ 26.74
From Germany to U.S.A.

Quantity: 2 available

Add to basket

There are 12 more copies of this book

View all search results for this book