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...

Full description

Bibliographic Details
Other Authors: Pralat, Pawel (Editor), Janssen, Jeannette (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 2007, 2007
Edition:1st ed. 2007
Series:Computer Communication Networks and Telecommunications
Subjects:
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
LEADER 03542nmm a2200373 u 4500
001 EB000380018
003 EBX01000000000000000233070
005 00000000000000.0
007 cr|||||||||||||||||||||
008 130626 ||| eng
020 |a 9783540772941 
100 1 |a Pralat, Pawel  |e [editor] 
245 0 0 |a Combinatorial and Algorithmic Aspects of Networking  |h Elektronische Ressource  |b 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers  |c edited by Pawel Pralat, Jeannette Janssen 
250 |a 1st ed. 2007 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 2007, 2007 
300 |a VIII, 152 p  |b online resource 
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 
653 |a Computer Communication Networks 
653 |a Algorithms 
653 |a Game Theory 
653 |a Application software 
653 |a Computer networks  
653 |a Game theory 
653 |a Computer Engineering and Networks 
653 |a Computer engineering 
653 |a Computer and Information Systems Applications 
700 1 |a Janssen, Jeannette  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b Springer  |a Springer eBooks 2005- 
490 0 |a Computer Communication Networks and Telecommunications 
028 5 0 |a 10.1007/978-3-540-77294-1 
856 4 0 |u https://doi.org/10.1007/978-3-540-77294-1?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 004.6 
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