LEADER 04192nam 2200649 450 001 996466170603316 005 20220428135722.0 010 $a3-540-77294-4 024 7 $a10.1007/978-3-540-77294-1 035 $a(CKB)1000000000490385 035 $a(SSID)ssj0000316679 035 $a(PQKBManifestationID)11240504 035 $a(PQKBTitleCode)TC0000316679 035 $a(PQKBWorkID)10292668 035 $a(PQKB)10757286 035 $a(DE-He213)978-3-540-77294-1 035 $a(MiAaPQ)EBC4976244 035 $a(MiAaPQ)EBC336839 035 $a(MiAaPQ)EBC6700608 035 $a(Au-PeEL)EBL336839 035 $a(OCoLC)935267565 035 $a(Au-PeEL)EBL6700608 035 $a(PPN)123731747 035 $a(EXLCZ)991000000000490385 100 $a20220428d2007 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 00$aCombinatorial and algorithmic aspects of networking $e4th workshop, CAAN 2007, Halifax, Canada, August 14, 2007, revised papers /$fedited by Pawel Pralat and Jeannette Janssen 205 $a1st ed. 2007. 210 1$aBerlin, Germany ;$aNew York, New York :$cSpringer,$d[2007] 210 4$dİ2007 215 $a1 online resource (VIII, 152 p.) 225 1 $aComputer Communication Networks and Telecommunications ;$v4852 300 $aIncludes index. 311 $a3-540-77293-6 327 $aInvited 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. 330 $aThe 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. 410 0$aComputer Communication Networks and Telecommunications ;$v4852 606 $aComputer networks$vCongresses 606 $aAlgorithms$vCongresses 606 $aInternet$vCongresses 615 0$aComputer networks 615 0$aAlgorithms 615 0$aInternet 676 $a004.6 702 $aJanssen$b Jeannette 702 $aPra?at$b Pawe? 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996466170603316 996 $aCombinatorial and Algorithmic Aspects of Networking$9772188 997 $aUNISA