OPAC

Combinatorial and Algorithmic Aspects of Networking : Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / edited by Thomas Erlebach
(Computer Communication Networks and Telecommunications. ISSN:29459184 ; 4235)

データ種別	電子ブック
版	1st ed. 2006.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	2006
大きさ	VIII, 134 p : online resource
著者標目	Erlebach, Thomas editor SpringerLink (Online service)

URL	巻　次	配架場所	請求記号	登録番号	コメント	刷　年	状　態	利用注記	ISBN	予約	請求メモ
URL		射水-電子	007	EB0003164	Computer Scinece R0 2005-6,2022-3				9783540488248

一般注記	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 HTTP:URL=https://doi.org/10.1007/11922377
件　名	LCSH:Computer networks LCSH:Application software LCSH:Computer engineering LCSH:Algorithms LCSH:Game theory FREE:Computer Communication Networks FREE:Computer and Information Systems Applications FREE:Computer Engineering and Networks FREE:Algorithms FREE:Game Theory
分　類	LCC:TK5105.5-5105.9 DC23:004.6
書誌ID	EB00002552
ISBN	9783540488248