This book constitutes the thoroughly refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006.

The 10 revised full papers and one invited lecture cover a range from the Web graph to game theory to string matching, all in the context of large-scale networks.

Inhalt

Invited Lecture.- Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks.- Contributed Papers.- The Price of Anarchy in Selfish Multicast Routing.- Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem.- On the Topologies of Local Minimum Spanning Trees.- Distributed Routing in Tree Networks with Few Landmarks.- Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs.- On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing.- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP.- Acyclic Type-of-Relationship Problems on the Internet.- Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The ??d Case).- Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks.