Combinatorial and Algorithmic Aspects of Networking Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers
by
 
Erlebach, Thomas. editor.

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

Author
Erlebach, Thomas. editor.

ISBN
9783540488248

Physical Description
VIII, 134 p. online resource.

Series
Lecture Notes in Computer Science, 4235

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.

Subject Term
Computer science.
 
Computer network architectures.
 
Computer Communication Networks.
 
Computer software.
 
Information systems.
 
Mathematics.
 
Information Systems Applications (incl.Internet).
 
Computer Systems Organization and Communication Networks.
 
Algorithm Analysis and Problem Complexity.
 
Game Theory, Economics, Social and Behav. Sciences.

Added Author
Erlebach, Thomas.

Added Corporate Author
SpringerLink (Online service)

Electronic Access
http://dx.doi.org/10.1007/11922377


LibraryMaterial TypeItem BarcodeShelf NumberStatus
IYTE LibraryE-Book511914-1001QA76.76 .A65Online Springer