LEADER 04652nam 22007935 450 001 9910144152503321 005 20251116234547.0 010 $a1-280-30785-4 010 $a9786610307852 010 $a3-540-27796-X 024 7 $a10.1007/b98251 035 $a(CKB)1000000000212434 035 $a(SSID)ssj0000252598 035 $a(PQKBManifestationID)11204911 035 $a(PQKBTitleCode)TC0000252598 035 $a(PQKBWorkID)10199211 035 $a(PQKB)11513999 035 $a(DE-He213)978-3-540-27796-5 035 $a(MiAaPQ)EBC3088004 035 $a(PPN)155233963 035 $a(BIP)46175964 035 $a(BIP)10695658 035 $a(EXLCZ)991000000000212434 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aStructural Information and Communication Complexity $e11th International Colloquium , SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004, Proceedings /$fedited by Ratislav Královic, Ondrej Sykora 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (X, 303 p.) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v3104 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-22230-8 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aTraffic Grooming in a Passive Star WDM Network -- The Price of Anarchy in All-Optical Networks -- Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks -- Path Layout on Tree Networks: Bounds in Different Label Switching Models -- On Approximability of the Independent Set Problem for Low Degree Graphs -- Asynchronous Broadcast in Radio Networks -- Two-Hop Virtual Path Layout in Tori -- Robot Convergence via Center-of-Gravity Algorithms -- F-Chord: Improved Uniform Routing on Chord -- Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor -- Improved Bounds for Optimal Black Hole Search with a Network Map -- Sparse Additive Spanners for Bounded Tree-Length Graphs -- No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes -- Existence of Nash Equilibria in Selfish Routing Problems -- Mobile Agents Rendezvous When Tokens Fail -- Time Efficient Gossiping in Known Radio Networks -- Long-Lived Rambo: Trading Knowledge for Communication -- Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach -- Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks -- Perfect Token Distribution on Trees -- Approximation Algorithm for Hotlink Assignment in the Greedy Model -- Optimal Decision Strategies in Byzantine Environments -- Sharing the Cost of Multicast Transmissions in Wireless Networks -- NP-Completeness Results for All-Shortest-Path Interval Routing -- On-Line Scheduling of Parallel Jobs -- The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces. 330 $aThis book constitutes the refereed proceedings of the 11th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2004, held in Smolenice Castle, Slowakia in June 2004.The 26 revised full papers presented were carefully reviewed and selected from 56 submissions. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v3104 606 $aComputer networks 606 $aAlgorithms 606 $aComputer science$xMathematics 606 $aDiscrete mathematics 606 $aArtificial intelligence$xData processing 606 $aComputer Communication Networks 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aData Science 615 0$aComputer networks. 615 0$aAlgorithms. 615 0$aComputer science$xMathematics. 615 0$aDiscrete mathematics. 615 0$aArtificial intelligence$xData processing. 615 14$aComputer Communication Networks. 615 24$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aData Science. 676 $a004.36 702 $aKrálovic$b Ratislav$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSykora$b Ondrej$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aColloquium on Structural Information and Communication Complexity 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910144152503321 996 $aStructural Information and Communication Complexity$92889850 997 $aUNINA