Combinatorial and Algorithmic Aspects of Networking Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / [electronic resource] :
edited by Thomas Erlebach.
- 1st ed. 2006.
- VIII, 134 p. online resource.
- Computer Communication Networks and Telecommunications, 4235 2945-9184 ; .
- Computer Communication Networks and Telecommunications, 4235 .
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.
9783540488248
10.1007/11922377 doi
Computer networks .
Application software.
Computer engineering.
Algorithms.
Game theory.
Computer Communication Networks.
Computer and Information Systems Applications.
Computer Engineering and Networks.
Algorithms.
Game Theory.
TK5105.5-5105.9
004.6
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.
9783540488248
10.1007/11922377 doi
Computer networks .
Application software.
Computer engineering.
Algorithms.
Game theory.
Computer Communication Networks.
Computer and Information Systems Applications.
Computer Engineering and Networks.
Algorithms.
Game Theory.
TK5105.5-5105.9
004.6