Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications
Author:   Martin Charles Golumbic ,  Irith Ben-Arroyo Hartman
Publisher:   Springer-Verlag New York Inc.
Edition:   2005 ed.
Volume:   v. 34
ISBN:  

9780387243474


Pages:   292
Publication Date:   26 August 2005
Format:   Hardback
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Our Price $303.60 Quantity:  
Add to Cart

Share |

Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications


Add your own review!

Overview

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.  

Full Product Details

Author:   Martin Charles Golumbic ,  Irith Ben-Arroyo Hartman
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2005 ed.
Volume:   v. 34
Dimensions:   Width: 15.50cm , Height: 1.70cm , Length: 23.50cm
Weight:   1.330kg
ISBN:  

9780387243474


ISBN 10:   038724347
Pages:   292
Publication Date:   26 August 2005
Audience:   College/higher education ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   In Print   Availability explained
This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.

Table of Contents

Optimization Problems Related to Internet Congestion Control.- Problems in Data Structures and Algorithms.- Algorithmic Graph Theory and Its Applications.- Decompositions and Forcing Relations in Graphs and Other Combinatorial Structures.- The Local Ratio Technique and Its Application to Scheduling and Resource Allocation Problems.- Domination Analysis of Combinatorial Optimization Algorithms and Problems.- On Multi-Object Auctions and Matching Theory: Algorithmic Aspects.- Strategies for Searching Graphs.- Recent Trends in Arc Routing.- Software and Hardware Testing Using Combinatorial Covering Suites.- Incidences.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now