E-Book, Englisch, Band 4235, 134 Seiten, eBook
Erlebach Combinatorial and Algorithmic Aspects of Networking
2006
ISBN: 978-3-540-48824-8
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers
E-Book, Englisch, Band 4235, 134 Seiten, eBook
Reihe: Lecture Notes in Computer Science
ISBN: 978-3-540-48824-8
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark
Zielgruppe
Research
Autoren/Hrsg.
Weitere Infos & Material
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.