Syndetics omslagsbild
Bild från Syndetics

Combinatorial and Algorithmic Aspects of Networking [electronic resource] : Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers / edited by Thomas Erlebach.

Medverkande: Materialtyp: TextSerie: Utgivningsuppgift: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2006Utgåva: 1st ed. 2006Beskrivning: VIII, 134 p. online resourceInnehållstyp:
  • text
Medietyp:
  • computer
Bärartyp:
  • online resource
ISBN:
  • 9783540488248
Ämnen: DDK-klassifikation:
  • 004.6 23
Onlineresurser:
Innehåll:
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.
Inga fysiska exemplar för denna post

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.

Licensed e-book