Combinatorial and Algorithmic Aspects of Networking [[electronic resource] ] : Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / / edited by Thomas Erlebach
(Visualizza in formato marc)
(Visualizza in BIBFRAME)
| Titolo: |
Combinatorial and Algorithmic Aspects of Networking [[electronic resource] ] : Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / / edited by Thomas Erlebach
|
| Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Edizione: | 1st ed. 2006. |
| Descrizione fisica: | 1 online resource (VIII, 134 p.) |
| Disciplina: | 004.6 |
| Soggetto topico: | Computer communication systems |
| Application software | |
| Computer organization | |
| Algorithms | |
| Game theory | |
| Computer Communication Networks | |
| Information Systems Applications (incl. Internet) | |
| Computer Systems Organization and Communication Networks | |
| Algorithm Analysis and Problem Complexity | |
| Game Theory, Economics, Social and Behav. Sciences | |
| Persona (resp. second.): | ErlebachThomas |
| 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. |
| Titolo autorizzato: | Combinatorial and Algorithmic Aspects of Networking |
| ISBN: | 3-540-48824-3 |
| Formato: | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione: | Inglese |
| Record Nr.: | 996466145503316 |
| Lo trovi qui: | Univ. di Salerno |
| Opac: | Controlla la disponibilità qui |
Serie:
Computer Communication Networks and Telecommunications ; ; 4235