Cargando…

Combinatorial and Algorithmic Aspects of Networking 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers /

The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to - citing new research directions in mathematics and theoretical computer science, especially in the areas of combinatorics and algorithms. The Fourth W...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Pralat, Pawel (Editor ), Janssen, Jeannette (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Computer Communication Networks and Telecommunications, 4852
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-540-77294-1
003 DE-He213
005 20220311213456.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 |a 9783540772941  |9 978-3-540-77294-1 
024 7 |a 10.1007/978-3-540-77294-1  |2 doi 
050 4 |a TK5105.5-5105.9 
072 7 |a UKN  |2 bicssc 
072 7 |a COM075000  |2 bisacsh 
072 7 |a UKN  |2 thema 
082 0 4 |a 004.6  |2 23 
245 1 0 |a Combinatorial and Algorithmic Aspects of Networking  |h [electronic resource] :  |b 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers /  |c edited by Pawel Pralat, Jeannette Janssen. 
250 |a 1st ed. 2007. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2007. 
300 |a VIII, 152 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 Computer Communication Networks and Telecommunications,  |x 2945-9184 ;  |v 4852 
505 0 |a Invited Lectures (Abstracts) -- Luck vs. Skill -- Valiant Load Balancing, Benes Networks and Resilient Backbone Design -- Contributed Papers -- Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design -- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm -- Nonadaptive Selfish Routing with Online Demands -- Vertex Pursuit Games in Stochastic Network Models -- Preemptive Scheduling on Selfish Machines -- Selfish Routing and Path Coloring in All-Optical Networks -- A Worst-Case Time Upper Bound for Counting the Number of Independent Sets -- Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP -- Combinatorial Algorithms for Listing Paths in Minimal Change Order -- Improving Topological Routing in N2R Networks. 
520 |a The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to - citing new research directions in mathematics and theoretical computer science, especially in the areas of combinatorics and algorithms. The Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007) was organized to be a place where the latest research developments on all aspects of networking could be presented. The topics covered were diverse, with talks on strategies for searching in networks, for cleaning networks of unwanted - truders, on di?erent routing strategies, and on scheduling and load balancing. The workshop started with an invited lecture by Peter Winkler of Dartmouth College, who gave a general talk on a topic related to probability, a concept central to network modeling and managing. The afternoon opened with a short invited talk by Alejandro Lop ´ ez-Ortiz, who gave an overview of various issues in designing resilient backbone networks. CAAN 2007 took place on August 14, 2007, at Dalhousie University in Halifax, Nova Scotia, Canada, co-located with the Workshop on Algorithms and Data Structures (WADS 2007). Three previous CAAN workshops were held in Chester, UK (CAAN 2006), Waterloo, Ontario, Canada (CAAN 2005), and in Ban?, Alberta, Canada (CAAN 2004), respectively. 
650 0 |a Computer networks . 
650 0 |a Application software. 
650 0 |a Computer engineering. 
650 0 |a Algorithms. 
650 0 |a Game theory. 
650 1 4 |a Computer Communication Networks. 
650 2 4 |a Computer and Information Systems Applications. 
650 2 4 |a Computer Engineering and Networks. 
650 2 4 |a Algorithms. 
650 2 4 |a Game Theory. 
700 1 |a Pralat, Pawel.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Janssen, Jeannette.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783540846642 
776 0 8 |i Printed edition:  |z 9783540772934 
830 0 |a Computer Communication Networks and Telecommunications,  |x 2945-9184 ;  |v 4852 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-540-77294-1  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)