Combinatorial and Algorithmic Aspects of Networking [electronic resource] :First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers / edited by Alejandro López-Ortiz, Angèle M. Hamel.
by López-Ortiz, Alejandro [editor.]; Hamel, Angèle M [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 3405Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: VIII, 205 p. Also available online. online resource.ISBN: 9783540318606.Subject(s): Computer science | Computer network architectures | Computer Communication Networks | Computer software | Information systems | Mathematics | Computer Science | Information Systems Applications (incl.Internet) | Computer Systems Organization and Communication Networks | Computer Communication Networks | Algorithm Analysis and Problem Complexity | Game Theory, Economics, Social and Behav. SciencesDDC classification: 005.7 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.76.A65 (Browse shelf) | Available |
Browsing MAIN LIBRARY Shelves Close shelf browser
| QA76.76.A65 Reasoning Web | QA76.76.A65 Advances in Web-Based Learning – ICWL 2005 | QA76.76.A65 E-Commerce and Web Technologies | QA76.76.A65 Combinatorial and Algorithmic Aspects of Networking | QA76.76.A65 Business Process Management | QA76.76.A65 Principles and Practice of Semantic Web Reasoning | QA76.76.A65 Trust Management |
Workshop Proceedings -- Aggregating Correlated Data in Sensor Networks -- The Efficiency of Optimal Taxes -- Congestion Games, Load Balancing, and Price of Anarchy -- Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives -- Limits and Power Laws of Models for the Web Graph and Other Networked Information Spaces -- Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing -- A Distributed Algorithm to Find Hamiltonian Cycles in Random Graphs -- String Matching on the Internet -- k-Robust Single-Message Transmission -- Stable Local Scheduling Algorithms With Low Complexity and Without Speedup for a Network of Input-Buffered Switches -- The External Network Problem with Edge- or Arc-Connectivity Requirements -- Bipartite Graphs as Models of Complex Networks -- Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis -- Invited Talk: The Many Wonders of the Web Graph -- Survey Articles -- Algorithmic Foundations of the Internet:Foreword -- A Survey of Models of the Web Graph -- You Can Get There from Here: Routing in the Internet -- Search Engines and Web Information Retrieval -- Algorithmic Foundations of the Internet: Roundup.
This book constitutes the refereed proceedings of the first workshop on Combinatorial and Algorithmic Aspects of Networking, held in Banff, Alberta, Canada in August 2004. The 12 revised full papers together with two invited papers presented were carefully reviewed and selected for inclusion in the book. The topics covered range from the web graph to game theory to string matching, all in the context of large-scale networks. This volume contains also 5 survey articles to round out the presentation and give a comprehensive introduction to the topic.
There are no comments for this item.