Combinatorial and Algorithmic Aspects of Networking网络的组合与算法问题/2004年会议录

书籍目录

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 G(n,p) 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 GraphSurvey 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: RoundupAuthor Index

作者简介

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.

 Combinatorial and Algorithmic Aspects of Networking网络的组合与算法问题/2004年会议录下载