LEADER 03916nam 22007815 450 001 9910767536003321 005 20251226202558.0 010 $a3-540-48824-3 024 7 $a10.1007/11922377 035 $a(CKB)1000000000283764 035 $a(SSID)ssj0000316681 035 $a(PQKBManifestationID)11923491 035 $a(PQKBTitleCode)TC0000316681 035 $a(PQKBWorkID)10276212 035 $a(PQKB)11248053 035 $a(DE-He213)978-3-540-48824-8 035 $a(MiAaPQ)EBC3068543 035 $a(PPN)123139554 035 $a(BIP)34164474 035 $a(BIP)13947279 035 $a(EXLCZ)991000000000283764 100 $a20100324d2006 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial and Algorithmic Aspects of Networking $eThird Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers /$fedited by Thomas Erlebach 205 $a1st ed. 2006. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2006. 215 $a1 online resource (VIII, 134 p.) 225 1 $aComputer Communication Networks and Telecommunications,$x2945-9184 ;$v4235 300 $aInternational conference proceedings. 311 08$a3-540-48822-7 320 $aIncludes bibliographical references and index. 327 $aInvited Lecture -- Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks -- Contributed Papers -- The Price of Anarchy in Selfish Multicast Routing -- Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem -- On the Topologies of Local Minimum Spanning Trees -- Distributed Routing in Tree Networks with Few Landmarks -- Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs -- On Minimizing the Number of ADMs ? Tight Bounds for an Algorithm Without Preprocessing -- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP -- Acyclic Type-of-Relationship Problems on the Internet -- Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The ??d Case) -- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. 330 $aThis book constitutes the thoroughly refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006. The 10 revised full papers and one invited lecture cover a range from the Web graph to game theory to string matching, all in the context of large-scale networks. 410 0$aComputer Communication Networks and Telecommunications,$x2945-9184 ;$v4235 606 $aComputer networks 606 $aApplication software 606 $aComputer engineering 606 $aAlgorithms 606 $aGame theory 606 $aComputer Communication Networks 606 $aComputer and Information Systems Applications 606 $aComputer Engineering and Networks 606 $aAlgorithms 606 $aGame Theory 615 0$aComputer networks. 615 0$aApplication software. 615 0$aComputer engineering. 615 0$aAlgorithms. 615 0$aGame theory. 615 14$aComputer Communication Networks. 615 24$aComputer and Information Systems Applications. 615 24$aComputer Engineering and Networks. 615 24$aAlgorithms. 615 24$aGame Theory. 676 $a004.6 701 $aErlebach$b Thomas$01272253 712 12$aWorkshop on Combinatorial and Algorithmic Aspects of Networking 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767536003321 996 $aCombinatorial and algorithmic aspects of networking$94187489 997 $aUNINA