Combinatorial and Algorithmic Aspects of Networking [electronic resource] : Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / edited by Thomas Erlebach.
Contributor(s): Erlebach, Thomas [editor.]
| SpringerLink (Online service).
Material type: 
BookSeries: Computer Communication Networks and Telecommunications: 4235Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Edition: 1st ed. 2006.Description: VIII, 134 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540488248.Subject(s): Computer networks | Application software | Computer engineering | Algorithms | Game theory | Computer Communication Networks | Computer and Information Systems Applications | Computer Engineering and Networks | Algorithms | Game TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.6 Online resources: Click here to access online 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.
There are no comments for this item.