Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Korte, Bernhard; Vygen, Jens
ISBN 10: 3662560380 ISBN 13: 9783662560389
Editore: Springer, 2018
Nuovi
Rilegato
Da
Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Venditore AbeBooks dal 25 marzo 2015
Questo articolo specifico non è più disponibile.
Riguardo questo articolo
Descrizione:
In English. Codice articolo ria9783662560389_new
Riassunto:
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.
Informazioni sull?autore:
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Dati bibliografici
Titolo: Combinatorial Optimization: Theory and ...
Casa editrice: Springer
Data di pubblicazione: 2018
Legatura: Rilegato
Condizione: New
I migliori risultati di ricerca su AbeBooks
Foto dell'editore
Combinatorial Optimization: Theory and Algorithms
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Hardcover. Condizione: Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. Codice articolo G3662560380I5N00
Compra usato
EUR 58,05
Spedizione gratuita
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 1 disponibili
Foto dell'editore
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Da: Books From California, Simi Valley, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
hardcover. Condizione: Very Good. Codice articolo mon0003865158
Compra usato
EUR 63,40
EUR 4,25 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: 3 disponibili
Immagini fornite dal venditore
Combinatorial Optimization : Theory and Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 30500279
Compra usato
EUR 77,48
EUR 2,25 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorial Optimization
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 4 su 5 stelle
Gebunden. Condizione: 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 . Codice articolo 178843969
Compra nuovo
EUR 81,44
EUR 48,99 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: Più di 20 disponibili
Combinatorial Optimization | Theory and Algorithms
Print on DemandDa: preigu, Osnabrück, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 111047545
Compra nuovo
EUR 84,60
EUR 70,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 5 disponibili
Foto dell'editore
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020317372
Compra nuovo
EUR 93,91
EUR 3,40 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorial Optimization : Theory and Algorithms
Da: GreatBookPrices, Columbia, MD, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 30500279-n
Compra nuovo
EUR 95,08
EUR 2,25 shipping
Spedito in U.S.A.
Spedito in U.S.A.
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorial Optimization : Theory and Algorithms
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783662560389
Compra nuovo
EUR 96,29
EUR 66,16 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 1 disponibili
Immagini fornite dal venditore
Combinatorial Optimization
ISBN 10: 3662560380
ISBN 13: 9783662560389
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783662560389
Compra nuovo
EUR 96,29
EUR 60,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili
Immagini fornite dal venditore
Combinatorial Optimization
Editore:
Springer Berlin Heidelberg Mrz 2018, 2018
ISBN 10: 3662560380
ISBN 13: 9783662560389
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783662560389
Compra nuovo
EUR 96,29
EUR 23,00 shipping
Spedito da Germania a U.S.A.
Spedito da Germania a U.S.A.
Quantità: 2 disponibili