E-Book, Englisch, Band 21, 530 Seiten, eBook
Reihe: Algorithms and Combinatorics
Korte / Vygen Combinatorial Optimization
2. Auflage 2002
ISBN: 978-3-662-21711-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Theory and Algorithms
E-Book, Englisch, Band 21, 530 Seiten, eBook
Reihe: Algorithms and Combinatorics
ISBN: 978-3-662-21711-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
It was more than a surprise to us that the first edition of this book already went out of print about a year after its first appearance. We were flattered by the many positive and even enthusiastic comments and letters from colleagues and the gen eral readership. Several of our colleagues helped us in finding typographical and other errors. In particular, we thank Ulrich Brenner, Andras Frank, Bernd Gartner and Rolf Mohring. Of course, all errors detected so far have been corrected in this second edition, and references have been updated. Moreover, the first preface had a flaw. We listed all individuals who helped us in preparing this book. But we forgot to mention the institutional support, for which we make amends here. It is evident that a book project which took seven years benefited from many different grants. We would like to mention explicitly the bilateral Hungarian German Research Project, sponsored by the Hungarian Academy of Sciences and the Deutsche Forschungsgemeinschaft, two Sonderforschungsbereiche (special re search units) of the Deutsche Forschungsgemeinschaft, the Ministere Franc;ais de la Recherche et de la Technologie and the Alexander von Humboldt Foundation for support via the Prix Alexandre de Humboldt, and the Commission of the Eu ropean Communities for participation in two projects DONET. Our most sincere thanks go to the Union of the German Academies of Sciences and Humanities and to the Northrhine-Westphalian Academy of Sciences.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.- Notation Index.- Author Index.
