| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910767536003321 |
|
|
Titolo |
Combinatorial and Algorithmic Aspects of Networking : Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / / edited by Thomas Erlebach |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2006.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 134 p.) |
|
|
|
|
|
|
Collana |
|
Computer Communication Networks and Telecommunications, , 2945-9184 ; ; 4235 |
|
|
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computer networks |
Application software |
Computer engineering |
Algorithms |
Game theory |
Computer Communication Networks |
Computer and Information Systems Applications |
Computer Engineering and Networks |
Game Theory |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
International conference proceedings. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references and index. |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
Sommario/riassunto |
|
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 and one invited lecture cover a range from the Web graph to game theory to string matching, all in the context of large-scale networks. |
|
|
|
|
|
|
|
| |