000 04521nam a22006015i 4500
001 978-3-540-77294-1
003 DE-He213
005 20240730194640.0
007 cr nn 008mamaa
008 100301s2007 gw | s |||| 0|eng d
020 _a9783540772941
_9978-3-540-77294-1
024 7 _a10.1007/978-3-540-77294-1
_2doi
050 4 _aTK5105.5-5105.9
072 7 _aUKN
_2bicssc
072 7 _aCOM043000
_2bisacsh
072 7 _aUKN
_2thema
082 0 4 _a004.6
_223
245 1 0 _aCombinatorial and Algorithmic Aspects of Networking
_h[electronic resource] :
_b4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers /
_cedited by Pawel Pralat, Jeannette Janssen.
250 _a1st ed. 2007.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2007.
300 _aVIII, 152 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aComputer Communication Networks and Telecommunications,
_x2945-9184 ;
_v4852
505 0 _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.
520 _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.
650 0 _aComputer networks .
_931572
650 0 _aApplication software.
_9157668
650 0 _aComputer engineering.
_910164
650 0 _aAlgorithms.
_93390
650 0 _aGame theory.
_96996
650 1 4 _aComputer Communication Networks.
_9157669
650 2 4 _aComputer and Information Systems Applications.
_9157670
650 2 4 _aComputer Engineering and Networks.
_9157671
650 2 4 _aAlgorithms.
_93390
650 2 4 _aGame Theory.
_96996
700 1 _aPralat, Pawel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_971630
700 1 _aJanssen, Jeannette.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9157672
710 2 _aSpringerLink (Online service)
_9157673
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540772934
776 0 8 _iPrinted edition:
_z9783540846642
830 0 _aComputer Communication Networks and Telecommunications,
_x2945-9184 ;
_v4852
_9157674
856 4 0 _uhttps://doi.org/10.1007/978-3-540-77294-1
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95279
_d95279