Combinatorial and Algorithmic Aspects of Networking [electronic resource] :Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers / edited by Thomas Erlebach.
by Erlebach, Thomas [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 4235Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006.Description: VIII, 135 p. Also available online. online resource.ISBN: 9783540488248.Subject(s): Computer science | Computer network architectures | Computer Communication Networks | Computer software | Information systems | Mathematics | Computer Science | Information Systems Applications (incl.Internet) | Computer Systems Organization and Communication Networks | Computer Communication Networks | Algorithm Analysis and Problem Complexity | Game Theory, Economics, Social and Behav. SciencesDDC classification: 005.7 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.76.A65 (Browse shelf) | Available |
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.
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.
There are no comments for this item.