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: 64.49 EUR
Availability: OutOfStock
Author: Thomas Erlebach

Cena

€ 64,49

Pasūtīts no attālās noliktavas

Paredzamā piegāde . gada 12. - 26. aug.

Saņemiet paziņojumus par jauniem Thomas Erlebach izdevumiem

Mūsu klienti saka:

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

14 dienu atgriešanas politika saskaņā ar Eiropas patērētāju tiesību aizsardzības likumu

Top vieta Trustpilot

Pievienot savam iMusic vēlmju sarakstam

Not rated yet

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."

Mediji	Grāmatas Paperback Book (Grāmata ar mīksto vāku un līmēto muguru)
Izlaists	2006. gada 8. decembris
ISBN13	9783540488224
Izdevēji	Springer-Verlag Berlin and Heidelberg Gm
Lapas	134
Izmēri	148 × 210 × 8 mm · 235 g
Valoda	Vācu