| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910483584203321 |
|
|
Titolo |
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 Hamel |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
|
|
|
|
|
|
|
|
|
Edizione |
[1st ed. 2005.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 205 p.) |
|
|
|
|
|
|
Collana |
|
Computer Communication Networks and Telecommunications ; ; 3405 |
|
|
|
|
|
|
Classificazione |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Application software |
Computer organization |
Computer communication systems |
Algorithms |
Game theory |
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 |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographic references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
| |