Cantitate/Preț
Produs

Combinatorial and Algorithmic Aspects of Networking: Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers: Lecture Notes in Computer Science, cartea 4235

Editat de Thomas Erlebach
en Limba Engleză Paperback – 8 dec 2006

Din seria Lecture Notes in Computer Science

Preț: 31925 lei

Preț vechi: 39906 lei
-20% Nou

Puncte Express: 479

Preț estimativ în valută:
6110 6351$ 5062£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540488224
ISBN-10: 3540488227
Pagini: 148
Ilustrații: VIII, 134 p.
Dimensiuni: 148 x 210 x 8 mm
Greutate: 0.24 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Computer Communication Networks and Telecommunications

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.