<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
β Scribed by Golumbic, Martin Charles & Hartman, Irith Ben-Arroyo
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 296
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
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 experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques.
β¦ Subjects
mathematics, Discrete Mathematics, General, Business & Economics, Operations Research, Combinatorics, Computers, Data Processing, Graphic Methods
π SIMILAR VOLUMES
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