Combinatorial and algorithmic aspects of networking : third workshop, CAAN 2006, Chester, UK, July 2, 2006 ; revised papers / Thomas Erlebach (ed.).

By: (3rd : Workshop on Combinatorial and Algorithmic Aspects of Networking (3rd : 2006 : Chester, England)
Contributor(s): Erlebach, Thomas
Material type: TextTextSeries: SerienbezeichnungLecture notes in computer science: 4235.Publisher: Berlin : Springer, 2006Description: 1 online resource (viii, 134 pages) : illustrationsContent type: text Media type: computer Carrier type: online resourceISBN: 9783540488248; 3540488243; 9783540488224; 3540488227Other title: CAAN 2006Subject(s): Computer networks -- Congresses | Internet -- Congresses | Algorithms -- Congresses | Combinatorial analysis -- Congresses | Informatique | Algorithms | Combinatorial analysis | Computer networks | Internet | algoritmen | algorithms | computeranalyse | computer analysis | speltheorie | game theory | informatiesystemen | information systems | internet | computerwetenschappen | computer sciences | computernetwerken | computer networks | Information and Communication Technology (General) | Informatie- en communicatietechnologie (algemeen)Genre/Form: Electronic books. | Conference papers and proceedings. Additional physical formats: Print version:: Combinatorial and algorithmic aspects of networking.DDC classification: 004.6 LOC classification: TK5105.5 | .W662 2006ebOnline resources: Click here to access online
Contents:
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.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current location Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library

Electronic Book@IST

EBook Available
Total holds: 0

International conference proceedings.

Includes bibliographical references and index.

Print version record.

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.

There are no comments for this item.

to post a comment.

Powered by Koha