![]() |
CAAN 2006Third Workshop on Combinatorial and Algorithmic Aspects of Networking2 July 2006Chester, United Kingdom(co-located with SIROCCO 2006)http://www.cs.le.ac.uk/events/CAAN2006/ |
![]() |
Please consider the SIROCCO pages for Travel Information and Information about the Venue.
Saturday, 1st July 2006 (Dining Room, Main Campus) | |
---|---|
18:00-19:00 | Registration and Wine Reception (Late arrivals will still be able to register during dinner or on Sunday morning.) |
19:00 | DINNER |
Sunday, 2nd July 2006 (Rigg Building) | |
9:00-9:30 |
Michele Flammini, Mordechai Shalom and Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing |
9:30-10:00 |
Guy Even and Moni Shahar:
Scheduling of smart antennas: capacitated coloring of unit circular-arc graphs |
10:00-10:30 |
Boris Goldengorin and Gerold Jaeger:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP |
10:30-11:00 | COFFEE BREAK |
11:00-11:30 |
Ioannis Emiris, Euripides Markou and Aris Pagourtzis: Distributed Routing in Tree Networks with Few Landmarks |
11:30-12:00 |
Andreas Baltz, Sandro Esquivel, Lasse Kliemann and Anand Srivastav: The Price of Anarchy in Selfish Multicast Routing |
12:00-12:30 |
Davide Bilò, Luciano Gualà and Guido Proietti: Hardness of Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem |
12:30-14:00 | LUNCH |
14:00-15:00 |
INVITED TALK: David Peleg: Approximation algorithms for minimum energy range assignment problems |
15:00-15:30 |
Andrzej Lingas, Mia Persson and Martin Wahlén: Minimum-Energy Broadcasting in Wireless Networks in the d-dimensional Euclidean Space (the $\alpha \le d$ case) |
15:30-16:00 | COFFEE BREAK |
16:00-16:30 |
Pier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati,
Luca Grilli, Katharina A. Lehmann, Giuseppe Liotta, Maurizio
Patrignani, Ioannis Tollis, Francesco Trotta: On the Topologies of Local Minimum Spanning Trees |
16:30-17:00 |
Sven Kosub, Moritz G. Maaß and Hanjo Täubig: Acyclic Type-of-Relationship Problems on the Internet |
17:00-17:30 |
Fredrik Manne and Qin Xin: Optimal Gossiping with Unit Size Messages in Known Radio Networks |