This is the most comprehensive compilation on combinatorial optiomization I have seen so far. Usually, Papadimitriou's book is a good place for this material - but in many cases, looking for proofs and theorems - I had to use several books: (*) Combinatorial Optimization Algorithms and Complexity by
Graph Theory, Combinatorics and Algorithms
β Scribed by Martin Charles Golumbic, Irith Ben-Arroyo Hartman
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Leaves
- 295
- Series
- Operations Research / Computer Science Interfaces Series
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
<span>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
<P><STRONG><EM>Graph Theory, Combinatorics and Algorithms:</EM> <EM>Interdisciplinary Applications</EM> focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.Β The book containsΒ
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering.Β The book containsΒ eleven chapters written by exp