E-Book, Englisch, 613 Seiten, eBook
Reihe: Algorithms and Combinatorics
Korte / Vygen Combinatorial Optimization
3rd Auflage 2006
ISBN: 978-3-540-29297-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Theory and Algorithms
E-Book, Englisch, 613 Seiten, eBook
Reihe: Algorithms and Combinatorics
ISBN: 978-3-540-29297-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
Graphs.- Linear Programming.- Linear Programming Algorithms.- Integer Programming.- Spanning Trees and Arborescences.- Shortest Paths.- Network Flows.- Minimum Cost Flows.- Maximum Matchings.- Weighted Matching.- b-Matchings and T-Joins.- Matroids.- Generalizations of Matroids.- NP-Completeness.- Approximation Algorithms.- The Knapsack Problem.- Bin-Packing.- Multicommodity Flows and Edge-Disjoint Paths.- Network Design Problems.- The Traveling Salesman Problem.- Facility Location.
