Combinatorial and Algorithmic Aspects of Networking
Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers
Published on 8. December 2006
Book
Paperback/Softback
VIII, 134 pages
978-3-540-48822-4 (ISBN)
Description
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.
More details
Series
Edition
2006 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
VIII, 134 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 9 mm
Weight
236 gr
ISBN-13
978-3-540-48822-4 (9783540488224)
DOI
10.1007/11922377
Schweitzer Classification
Content
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.