连网的组合与算法研究： CAAN 2006/会议论文集（书与在线文件）LNCS-4235: Combinatorial and algorithmic aspects of networking
点此进入淘宝搜索页搜索分類: 图书,进口原版书,科学与技术 Science & Techology ,
作者： Thomas Erlebach 著
出 版 社： 湖南文艺出版社
出版时间： 2006-12-1字数：版次： 1页数： 134印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540488224包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and Societies, LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS, including its sub series LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes
- Proceedings（published in time for the respective conference）
- Post-proceedings（consisting of thoroughly revised final full papers）
-research monographs（which may be based on outstanding PhD work, research projects, technical reports, etc.）
内容简介
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.
目录
Invited Lecture
Recent Advances on Approximation Algorithms for Minimum EnergyRange 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 BicriteriaProblem
On the Topologies of Local Minimum Spanning Trees
Distributed Routing in Tree Networks with Few Landmarks
Scheduling of a Smart Antenna: Capacitated Coloring of UnitCircular-Arc Graphs
On Minimizing the Number of ADMs - Tight Boundsfor an Algorithm Without Preprocessing
Tolerance Based Contract-or-Patch Heuristic for the AsymmetricTSP
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 Networks
Author Index
