Combinatorial Optimization: Algorithms and Complexity (Dover Books on Computer Science)

Book Details

• Publisher: Dover Publications

• Authors: Christos H. Papadimitriou, Kenneth Steiglitz

• Language: English

• Edition: New Edition

• ISBN: 9780486402581

• Pages: 528

• Cover: Paperback

• Format: Unabridged

• Dimensions: 8.4 x 5.3 x 1.0 inches

About The Book

Combinatorial Optimization: Algorithms and Complexity by Christos H. Papadimitriou and Kenneth Steiglitz is a rigorous and comprehensive textbook that serves as an essential guide to the field of combinatorial optimization. Written in a clear and concise manner, the book is designed for graduate-level students with a solid background in computer science, electrical engineering, or operations research.

This book delves into advanced topics such as the simplex method, the Soviet ellipsoid algorithm for linear programming, and network flow. It also explores efficient algorithms for network flow, spanning trees, matching, matroids, and the theory of NP-complete problems. Additionally, the authors discuss local search heuristics for NP-complete problems and approximation algorithms, providing readers with a thorough understanding of combinatorial optimization techniques.

What sets this textbook apart is the wealth of thought-provoking problems that accompany each chapter. These problems encourage critical thinking and problem-solving skills, making the book an invaluable resource for students. The new edition of this text was hailed by American Mathematical Monthly and continues to be an indispensable reference for those interested in the algorithms and complexities associated with combinatorial optimization.