Combinatorial and Algorithmic Aspects of Networking First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers / [electronic resource] :
edited by Alejandro López-Ortiz, Angèle M. Hamel.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
- VIII, 205 p. Also available online. online resource.
- Lecture Notes in Computer Science, 3405 0302-9743 ; .
- Lecture Notes in Computer Science, 3405 .
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.
9783540318606
10.1007/11527954 doi
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. Sciences.
QA76.76.A65
005.7
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.
9783540318606
10.1007/11527954 doi
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. Sciences.
QA76.76.A65
005.7