05367nam a22005295i 4500001001800000003000900018005001700027007001500044008004100059020001800100024002400118041000800142050001500150072001600165072002300181082001400204100003700218245023800255260006100493264006100554300003200615336002600647337002600673338003600699347002400735490005800759505158000817520186702397650002204264650003704286650004004323650002304363650003004386650001604416650002204432650004704454650004604501650002104547650003704568650001604605700003104621710003404652773002004686776003604706830005804742856003704800978-3-540-27796-5DE-He21320141014114344.0cr nn 008mamaa121227s2004 gw | s |||| 0|eng d a97835402779657 a10.1007/b982512doi aeng 4aQA76.9.A43 7aUMB2bicssc 7aCOM0513002bisacsh04a005.12231 aKrálovic̆, Ratislav.eeditor.10aStructural Information and Communication Complexityh[electronic resource] :b11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings /cedited by Ratislav Královic̆, Ondrej Sýkora. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. 1aBerlin, Heidelberg :bSpringer Berlin Heidelberg,c2004. aX, 303 p.bonline resource. atextbtxt2rdacontent acomputerbc2rdamedia aonline resourcebcr2rdacarrier atext filebPDF2rda1 aLecture Notes in Computer Science,x0302-9743 ;v31040 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. aThe Colloquium on Structural Information and Communication Complexity (SIROCCO) is an annual meeting focused on the relationship between comp- ing and communication. Over its 11 years of existence, SIROCCO has gained a considerable respect and has become an acknowledged forum bringing together specialists interested in the fundamental principles underlying all computing through communication. SIROCCO 2004 was the 11th in this series, held in Smolenice Castle, June 21–23,2004.PreviousSIROCCOcolloquiatookplaceinOttawa(1994),Olympia (1995), Siena (1996), Ascona (1997), Amal? (1998), Lacanau-Océan (1999), L’Aquila (2000), Val de Nuria (2001), Andros (2002), and Umeå(2003). The colloquium in 2004 was special in the respect that, for the ?rst time, the p- ceedings were published in the Lecture Notes in Computer Science series of Springer–Verlag. SIROCCO has alwaysencouragedhigh-quality researchfocused on the study of those factors which are signi?cant for the computability and the communi- tion complexity of problems,and onthe interplay betweenstructure, knowledge, and complexity. It covers topics as distributed computing, mobile computing, optical computing, parallel computing, communication complexity, information dissemination, routing protocols,distributed data-structures, models of com- nication, network topologies, high-speed interconnection networks, wireless n- works, sense of direction, structural properties, and topological awareness. The 56 contributions submitted to this year’s SIROCCO were subject to a thorough refereeing process and 26 high quality submissions were selected for publication. WethanktheProgramCommitteemembersfortheirprofoundandcarefulwork. Our gratitude extends to the numerous subreferees for their valuable refereeing. We also acknowledgethe e?ort of all authors who submitted their contributions. 0aComputer science. 0aComputer Communication Networks. 0aData structures (Computer science). 0aComputer software. 0aComputational complexity. 0aAlgorithms.14aComputer Science.24aAlgorithm Analysis and Problem Complexity.24aDiscrete Mathematics in Computer Science.24aData Structures.24aComputer Communication Networks.24aAlgorithms.1 aSýkora, Ondrej.eeditor.2 aSpringerLink (Online service)0 tSpringer eBooks08iPrinted edition:z9783540222309 0aLecture Notes in Computer Science,x0302-9743 ;v310440uhttp://dx.doi.org/10.1007/b98251