Structural information and communication complexity

Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings<br />Author: Ratislav Královic̆, Ondrej Sýkora<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-22230-9<br /> DOI: 10.1007/b98251<br /><br />Table of Contents:<p></p><ul><li>Traffic Grooming in a Passive Star WDM Network </li><li>The Price of Anarchy in All-Optical Networks </li><li>Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks </li><li>Path Layout on Tree Networks: Bounds in Different Label Switching Models </li><li>On Approximability of the Independent Set Problem for Low Degree Graphs </li><li>Asynchronous Broadcast in Radio Networks </li><li>Two-Hop Virtual Path Layout in Tori </li><li>Robot Convergence via Center-of-Gravity Algorithms </li><li>F-Chord: Improved Uniform Routing on Chord </li><li>Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor </li><li>Improved Bounds for Optimal Black Hole Search with a Network Map </li><li>Sparse Additive Spanners for Bounded Tree-Length Graphs </li><li>No-Hole L(p,0) Labelling of Cycles, Grids and Hypercubes </li><li>Existence of Nash Equilibria in Selfish Routing Problems </li><li>Mobile Agents Rendezvous When Tokens Fail </li><li>Time Efficient Gossiping in Known Radio Networks </li><li>Long-Lived Rambo: Trading Knowledge for Communication </li><li>Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach </li><li>Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks </li><li>Perfect Token Distribution on Trees</li></ul>