Downloads & Free Reading Options - Results

Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings Author: Ratislav Královic̆, Ondrej Sýkora Published by Springer Berlin Heidelberg ISBN: 978-3-540-22230-9 DOI: 10.1007/b98251 Table of Contents: Traffic 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

Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings Author: Ratislav Královic̆, Ondrej Sýkora Published by Springer Berlin Heidelberg ISBN: 978-3-540-22230-9 DOI: 10.1007/b98251 Table of Contents: Traffic 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