Thomas Erlebach
Combinatorial and Algorithmic Aspects of Networking: Third Workshop, Caan 2006, Chester, Uk, July 2, 2006, Revised Papers - Lecture Notes in Computer Science / Computer Communication Networks and Telecommunications Thomas Erlebach

Name: Combinatorial and Algorithmic Aspects of Networking: Third Workshop, Caan 2006, Chester, Uk, July 2, 2006, Revised Papers - Lecture Notes in Computer Science / Computer Communication Networks and Telecommunications
Price: 55.99 USD
Availability: OutOfStock
Author: Thomas Erlebach

Precio

$ 55,99

sin IVA

Pedido desde almacén remoto

Entrega prevista 26 de jun. - 9 de jul.

Nuestros clientes opinan:

Top-vurdering på Google Reviews, baseret på tusinder af anmeldelser.

Política de devolución de 14 días conforme a la legislación europea de protección de los consumidores

Mejor valorado en Trustpilot

Añadir a tu lista de deseos de iMusic

Combinatorial and Algorithmic Aspects of Networking: Third Workshop, Caan 2006, Chester, Uk, July 2, 2006, Revised Papers - Lecture Notes in Computer Science / Computer Communication Networks and Telecommunications

Thomas Erlebach

Constitutes the refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, that was held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006.

Marc Notes: International conference proceedings.; Also available in print.; Electronic reproduction.; UK: MyiLibrary; 2008. Table of 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."

Medios de comunicación	Libros Paperback Book (Libro con tapa blanda y lomo encolado)
Publicado	8 de diciembre de 2006
ISBN13	9783540488224
Editores	Springer-Verlag Berlin and Heidelberg Gm
Páginas	134
Dimensiones	148 × 210 × 8 mm · 235 g
Lengua	Alemán