Structural Information and Communication Complexity: 11th International Colloquium, SIROCCO 2004, Smolenice Castle, Slowakia, June 21-23, 2004. Proceedings

Eric Angel, Evripidis Bampis, Fanny Pascual (auth.), Ratislav Královic̆, Ondrej Sýkora (eds.)3540222308, 9783540222309, 9783540277965

This 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. Among the topics addressed are WDM networks, optical networks, ad-hoc networking, computational graph theory, graph algorithms, radio networks, routing, shortest-path problems, searching, labelling, distributed algorithms, communication networks, approximation algorithms, wireless networks, scheduling, NP completeness, Byzantine environments

---

Table of contents :
Front Matter….Pages –
Traffic Grooming in a Passive Star WDM Network….Pages 1-12
The Price of Anarchy in All-Optical Networks….Pages 13-22
Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks….Pages 23-34
Path Layout on Tree Networks: Bounds in Different Label Switching Models….Pages 35-46
On Approximability of the Independent Set Problem for Low Degree Graphs….Pages 47-56
Asynchronous Broadcast in Radio Networks….Pages 57-68
Two-Hop Virtual Path Layout in Tori….Pages 69-78
Robot Convergence via Center-of-Gravity Algorithms….Pages 79-88
F-Chord: Improved Uniform Routing on Chord….Pages 89-98
Swapping a Failing Edge of a Shortest Paths Tree by Minimizing the Average Stretch Factor….Pages 99-110
Improved Bounds for Optimal Black Hole Search with a Network Map….Pages 111-122
Sparse Additive Spanners for Bounded Tree-Length Graphs….Pages 123-137
No-Hole L ( p ,0) Labelling of Cycles, Grids and Hypercubes….Pages 138-148
Existence of Nash Equilibria in Selfish Routing Problems….Pages 149-160
Mobile Agents Rendezvous When Tokens Fail….Pages 161-172
Time Efficient Gossiping in Known Radio Networks….Pages 173-184
Long-Lived Rambo: Trading Knowledge for Communication….Pages 185-196
Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach….Pages 197-208
Tighter Bounds on Feedback Vertex Sets in Mesh-Based Networks….Pages 209-220
Perfect Token Distribution on Trees….Pages 221-232
Approximation Algorithm for Hotlink Assignment in the Greedy Model….Pages 233-244
Optimal Decision Strategies in Byzantine Environments….Pages 245-254
Sharing the Cost of Multicast Transmissions in Wireless Networks….Pages 255-266
NP-Completeness Results for All-Shortest-Path Interval Routing….Pages 267-278
On-Line Scheduling of Parallel Jobs….Pages 279-290
The Range Assignment Problem in Static Ad-Hoc Networks on Metric Spaces….Pages 291-302
Back Matter….Pages –