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.
Graph Theory, Combinatorics and Algorithms
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
Key Phrases - Statistically Improbable Phrases (SIPs):
(learn more)
interval realizer, covering suites, local ratio algorithm, probe interval graphs, partial set cover, proven optima, domination ratio, local ratio technique, constrained auctions, expected capture time, covering test suite, local ratio theorem, capacitated arc routing problem, rural postman problem, arc routing problems, expected search time, vertex set problem, tolerance graphs, poset relation, domination number, combinatorial auction problem, bipartition class, comparability graph, postman tour, transitive orientation Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Discrete Algorithms, Theory of Computing, Martin Charles Golumbic, Proof Let, Academic Press, Internet Congestion Control, Management Science, Optimization Problems Related, Cambridge University Press, Discrete Appl, European Journal of Operational Research, Mathematical Programming, Clemson University, Information Processing Letters, International Colloquium, Plenum Press, Seymour Benzer New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
interval realizer, covering suites, local ratio algorithm, probe interval graphs, partial set cover, proven optima, domination ratio, local ratio technique, constrained auctions, expected capture time, covering test suite, local ratio theorem, capacitated arc routing problem, rural postman problem, arc routing problems, expected search time, vertex set problem, tolerance graphs, poset relation, domination number, combinatorial auction problem, bipartition class, comparability graph, postman tour, transitive orientation Key Phrases - Capitalized Phrases (CAPs): (learn more)
New York, Discrete Algorithms, Theory of Computing, Martin Charles Golumbic, Proof Let, Academic Press, Internet Congestion Control, Management Science, Optimization Problems Related, Cambridge University Press, Discrete Appl, European Journal of Operational Research, Mathematical Programming, Clemson University, Information Processing Letters, International Colloquium, Plenum Press, Seymour Benzer New!
Books on Related Topics | Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Back Cover | Surprise Me!
Citations (learn more)
This book cites 32
books:
See all 32 books this book cites
1
book
cites this book:
- Tolerance Graphs (Cambridge Studies in Advanced Mathematics) by Martin Charles Golumbic on page 54, page 57, and page 60
- The Traveling Salesman Problem and Its Variations (Combinatorial Optimization) by G. Gutin on page 169, and page 170
- Search and Screening. General Principles with Historical Applications by B. O. Koopman on page 189, and page 213
- Theory of Optimal Search by Lawrence D. Stone on page 189, and page 214
- Integer Programming (Decision & Control) by R. Garfinkel on page 143
See all 32 books this book cites
Books on Related Topics
(learn more)
|
Suggested Tags from Similar Products(What's this?)Be the first one to add a relevant tag (keyword that's strongly related to this product).
|
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Business & Investing > Management & Leadership > Operations Research
- Books > Computers & Technology > Networking > Networks, Protocols & APIs
- Books > Computers & Technology > Programming > Algorithms
- Books > New & Used Textbooks > Business & Finance
- Books > New & Used Textbooks > Computer Science
- Books > New & Used Textbooks > Science & Mathematics > Mathematics
- Books > Science & Math > Mathematics
