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 /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: López-Ortiz, Alejandro (Επιμελητής έκδοσης), Hamel, Angèle M. (Επιμελητής έκδοσης)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
Σειρά:Lecture Notes in Computer Science, 3405
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03315nam a22005415i 4500
001 978-3-540-31860-6
003 DE-He213
005 20151204151751.0
007 cr nn 008mamaa
008 100715s2005 gw | s |||| 0|eng d
020 |a 9783540318606  |9 978-3-540-31860-6 
024 7 |a 10.1007/11527954  |2 doi 
040 |d GrThAP 
050 4 |a QA76.76.A65 
072 7 |a UNH  |2 bicssc 
072 7 |a UDBD  |2 bicssc 
072 7 |a COM032000  |2 bisacsh 
082 0 4 |a 005.7  |2 23 
245 1 0 |a Combinatorial and Algorithmic Aspects of Networking  |h [electronic resource] :  |b First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers /  |c edited by Alejandro López-Ortiz, Angèle M. Hamel. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg,  |c 2005. 
300 |a VIII, 205 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3405 
505 0 |a 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. 
650 0 |a Computer science. 
650 0 |a Computer organization. 
650 0 |a Computer communication systems. 
650 0 |a Algorithms. 
650 0 |a Game theory. 
650 1 4 |a Computer Science. 
650 2 4 |a Information Systems Applications (incl. Internet). 
650 2 4 |a Computer Systems Organization and Communication Networks. 
650 2 4 |a Computer Communication Networks. 
650 2 4 |a Algorithm Analysis and Problem Complexity. 
650 2 4 |a Game Theory, Economics, Social and Behav. Sciences. 
700 1 |a López-Ortiz, Alejandro.  |e editor. 
700 1 |a Hamel, Angèle M.  |e editor. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540278733 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 3405 
856 4 0 |u http://dx.doi.org/10.1007/11527954  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (Springer-11645)