61,95 €*
Versandkostenfrei per Post / DHL
Lieferzeit 4-7 Werktage
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.
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.
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.
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
Updated fifth edition
1 Introduction.- 2 Graphs.- 3 Linear Programming.- 4 Linear Programming Algorithms.- 5 Integer Programming.- 6 Spanning Trees and Arborescences.- 7 Shortest Paths.- 8 Network Flows.- 9 Minimum Cost Flows.- 10 Maximum Matchings.- 11 Weighted Matching.- 12
b
-Matchings and
T
-Joins.- 13 Matroids.- 14 Generalizations of Matroids.- 15
NP
-Completeness.- 16 Approximation Algorithms.- 17 The Knapsack Problem.- 18 Bin-Packing.- 19 Multicommodity Flows and Edge-Disjoint Paths.- 20 Network Design Problems.- 21 The Traveling Salesman Problem.- 22 Facility Location.- Indices.
| Erscheinungsjahr: | 2019 |
|---|---|
| Fachbereich: | Allgemeines |
| Genre: | Mathematik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 720 |
| Reihe: | Algorithms and Combinatorics |
| Inhalt: |
xxi
698 S. 78 s/w Illustr. 698 p. 78 illus. |
| ISBN-13: | 9783662585665 |
| ISBN-10: | 3662585669 |
| Sprache: | Englisch |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: |
Vygen, Jens
Korte, Bernhard |
| Auflage: | Softcover reprint of the original 6th ed. 2018 |
| Hersteller: |
Springer Berlin
Springer Berlin Heidelberg Algorithms and Combinatorics |
| Maße: | 235 x 155 x 39 mm |
| Von/Mit: | Jens Vygen (u. a.) |
| Erscheinungsdatum: | 11.01.2019 |
| Gewicht: | 1,072 kg |
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.
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
Updated fifth edition
1 Introduction.- 2 Graphs.- 3 Linear Programming.- 4 Linear Programming Algorithms.- 5 Integer Programming.- 6 Spanning Trees and Arborescences.- 7 Shortest Paths.- 8 Network Flows.- 9 Minimum Cost Flows.- 10 Maximum Matchings.- 11 Weighted Matching.- 12
b
-Matchings and
T
-Joins.- 13 Matroids.- 14 Generalizations of Matroids.- 15
NP
-Completeness.- 16 Approximation Algorithms.- 17 The Knapsack Problem.- 18 Bin-Packing.- 19 Multicommodity Flows and Edge-Disjoint Paths.- 20 Network Design Problems.- 21 The Traveling Salesman Problem.- 22 Facility Location.- Indices.
| Erscheinungsjahr: | 2019 |
|---|---|
| Fachbereich: | Allgemeines |
| Genre: | Mathematik |
| Rubrik: | Naturwissenschaften & Technik |
| Medium: | Taschenbuch |
| Seiten: | 720 |
| Reihe: | Algorithms and Combinatorics |
| Inhalt: |
xxi
698 S. 78 s/w Illustr. 698 p. 78 illus. |
| ISBN-13: | 9783662585665 |
| ISBN-10: | 3662585669 |
| Sprache: | Englisch |
| Ausstattung / Beilage: | Paperback |
| Einband: | Kartoniert / Broschiert |
| Autor: |
Vygen, Jens
Korte, Bernhard |
| Auflage: | Softcover reprint of the original 6th ed. 2018 |
| Hersteller: |
Springer Berlin
Springer Berlin Heidelberg Algorithms and Combinatorics |
| Maße: | 235 x 155 x 39 mm |
| Von/Mit: | Jens Vygen (u. a.) |
| Erscheinungsdatum: | 11.01.2019 |
| Gewicht: | 1,072 kg |
Ähnliche Produkte
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Wochen
Lieferzeit 1-2 Werktage
