Combinatorial and Algorithmic Aspects of Networking Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers /

• Corporate Author: SpringerLink (Online service)
• Other Authors: Erlebach, Thomas (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.
• Series: Lecture Notes in Computer Science, 4235
• Subjects: Computer science.; Computer organization.; Computer communication systems.; Algorithms.; Game theory.; Computer Science.; Computer Communication Networks.; Information Systems Applications (incl. Internet).; Computer Systems Organization and Communication Networks.; Algorithm Analysis and Problem Complexity.; Game Theory, Economics, Social and Behav. Sciences.

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.