Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, ... Notes in Computer Science, 3405, Band 3405) - Softcover

L??pez-Ortiz, Alejandro; Hamel, Ang??le

Softcover

ISBN 10: 3540278737 ISBN 13: 9783540278733

Verlag: Springer, 2008

Inhaltsangabe

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.

Details zur Ausgabe

• Verlag: Springer
• Erscheinungsdatum: 2008
• Sprache: Englisch
• ISBN 10: 3540278737
• ISBN 13: 9783540278733
• Einband: Taschenbuch
• Anzahl der Seiten: 220
• Kontakt zum Hersteller: Springer Nature Customer Service Center GmbH; ProductSafety@springernature.com; ; Europaplatz 3; Heidelberg; 69115; Deutschland