[Operations Research/Computer Science Interfaces Series] Graph Theory, Combinatorics and Algorithms Volume 34 || Problems in Data Structures and Algorithms

✍ Scribed by Golumbic, Martin Charles; Hartman, Irith Ben-Arroyo

• Book ID: 118056343
• Publisher: Springer-Verlag
• Year: 2005
• Tongue: English
• Weight: 374 KB
• Edition: 2005
• Category: Article
• ISBN-13: 9780387243474
• DOI: 10.1007/0-387-25036-0_2

✦ 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.