


default search action
3. CAAN 2006: Chester, UK
- Thomas Erlebach:

Combinatorial and Algorithmic Aspects of Networking, Third Workshop, CAAN 2006, Chester, UK, July 2, 2006. Revised Papers. Lecture Notes in Computer Science 4235, Springer 2006, ISBN 3-540-48822-7
Invited Lecture
- David Peleg:

Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks. 1-4
Contributed Papers
- Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav:

The Price of Anarchy in Selfish Multicast Routing. 5-18 - Davide Bilò

, Luciano Gualà
, Guido Proietti
:
Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem. 19-30 - Pier Francesco Cortese, Giuseppe Di Battista

, Fabrizio Frati
, Luca Grilli
, Katharina Anna Lehmann, Giuseppe Liotta
, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta:
On the Topologies of Local Minimum Spanning Trees. 31-44 - Ioannis Z. Emiris

, Euripides Markou, Aris Pagourtzis
:
Distributed Routing in Tree Networks with Few Landmarks. 45-57 - Guy Even, Shimon Shahar:

Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs. 58-71 - Michele Flammini

, Mordechai Shalom, Shmuel Zaks:
On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without Preprocessing. 72-85 - Boris Goldengorin

, Gerold Jäger, Paul Molitor
:
Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP. 86-97 - Sven Kosub

, Moritz G. Maaß, Hanjo Täubig:
Acyclic Type-of-Relationship Problems on the Internet. 98-111 - Andrzej Lingas, Mia Persson, Martin Wahlen:

Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). 112-124 - Fredrik Manne, Qin Xin:

Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. 125-134

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














