Articoli correlati a Combinatorial Optimization: Theory and Algorithms:...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
L'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.
- EditoreSpringer Nature
- Data di pubblicazione2018
- ISBN 10 3662560380
- ISBN 13 9783662560389
- RilegaturaCopertina rigida
- LinguaInglese
- Numero edizione6
- Numero di pagine698
Compra nuovo
Visualizza questo articolo
EUR 98,58
EUR 3,57 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Combinatorial Optimization: Theory and Algorithms:...
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
Quantità: Più di 20 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
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
Quantità: Più di 20 disponibili
Foto dell'editore
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783662560389
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorial Optimization : Theory and Algorithms
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: As New. Unread book in perfect condition. Codice articolo 30500279
Quantità: Più di 20 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
Quantità: 2 disponibili
Foto dell'editore
Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics, 21)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In English. Codice articolo ria9783662560389_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorial Optimization : Theory and Algorithms
Da: GreatBookPricesUK, Woodford Green, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo 30500279-n
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Combinatorial Optimization
Print on DemandDa: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
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
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
Quantità: 1 disponibili