Combinatorial and Algorithmic Aspects of Networking

Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers

148 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Angewandte Informatik
• ISBN: 9783540488224
• Sprache: Englisch
• Erscheinungsdatum: 08.12.2006
• Größe: 235 x 155 mm
• Verlag: Springer
• Herausgegeben von: Thomas Erlebach