连网的组合与算法研究

出版社:Springer-Verlag New York Inc
出版日期:2006-12
ISBN:9783540488224
作者:Erlebach, Thomas (EDT)
页数:134页

书籍目录

Invited Lecture Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless NetworksContributed Papers The Price of Anarchy in Selfish Multicast Routing Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria ProblemOn 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 Broadcastion in Wireless Networks in the d-Dimensional Euclidean Space(The a≤d Case)  Optimal Gossiping with Unit Size Messages in Known Topology Padio NetworksAuthor Index

作者简介

  This book constitutes the thoroughly refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006.  The 10 revised full papers together with 1 invited lecture presented were carefully reviewed and selected from a total of 22 submissions. The topics covered range from the Web graph to game theory to string matching, all in the context of large-scale networks.


 连网的组合与算法研究下载



发布书评

 
 


 

外国儿童文学,篆刻,百科,生物科学,科普,初中通用,育儿亲子,美容护肤PDF图书下载,。 零度图书网 

零度图书网 @ 2024