Combinatorial and Algorithmic Aspects of Networking: Third Workshop, Caan 2006, Chester, Uk, July 2, 2006, Revised Papers - Lecture Notes in Computer Science / Computer Communication Networks and Telecommunications

Marc Notes: International conference proceedings.; Also available in print.; Electronic reproduction.; UK: MyiLibrary; 2008. Table of Contents: 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."