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

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Erlebach, Thomas (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006.
Edición:1st ed. 2006.
Colección:Computer Communication Networks and Telecommunications, 4235
Temas:
Computer networks .
Application software.
Computer engineering.
Algorithms.
Game theory.
Computer Communication Networks.
Computer and Information Systems Applications.
Computer Engineering and Networks.
Game Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares