Graph Theory, Combinatorics and Algorithms [electronic resource] : Interdisciplinary Applications / edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman.

Contributor(s): Golumbic, Martin Charles [editor.] | Hartman, Irith Ben-Arroyo [editor.] | SpringerLink (Online service)
Material type: TextTextSeries: Operations Research/Computer Science Interfaces Series: 34Publisher: Boston, MA : Springer US, 2005Description: X, 292 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9780387250366Subject(s): Mathematics | Operations research | Decision making | Computer science -- Mathematics | Management science | Discrete mathematics | Combinatorics | Mathematics | Discrete Mathematics | Mathematics, general | Operations Research, Management Science | Operation Research/Decision Theory | Combinatorics | Discrete Mathematics in Computer ScienceAdditional physical formats: Printed edition:: No titleDDC classification: 511.1 LOC classification: QA150-272Online resources: Click here to access online
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.
In: Springer eBooksSummary: 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. .
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

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.

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

There are no comments for this item.

to post a comment.

Powered by Koha