Abstract is missing.
- Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless NetworksDavid Peleg. 1-4 [doi]
- The Price of Anarchy in Selfish Multicast RoutingAndreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav. 5-18 [doi]
- Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria ProblemDavide Bilò, Luciano Gualà, Guido Proietti. 19-30 [doi]
- On the Topologies of Local Minimum Spanning TreesPier Francesco Cortese, Giuseppe Di Battista, Fabrizio Frati, Luca Grilli, Katharina Anna Lehmann, Giuseppe Liotta, Maurizio Patrignani, Ioannis G. Tollis, Francesco Trotta. 31-44 [doi]
- Distributed Routing in Tree Networks with Few LandmarksIoannis Z. Emiris, Euripides Markou, Aris Pagourtzis. 45-57 [doi]
- Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc GraphsGuy Even, Shimon Shahar. 58-71 [doi]
- On Minimizing the Number of ADMs - Tight Bounds for an Algorithm Without PreprocessingMichele Flammini, Mordechai Shalom, Shmuel Zaks. 72-85 [doi]
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSPBoris Goldengorin, Gerold Jäger, Paul Molitor. 86-97 [doi]
- Acyclic Type-of-Relationship Problems on the InternetSven Kosub, Moritz G. Maaß, Hanjo Täubig. 98-111 [doi]
- Minimum-Energy Broadcasting in Wireless Networks in the ::::d::::-Dimensional Euclidean Space (The ::::alpha::::<=::::d:::: Case)Andrzej Lingas, Mia Persson, Martin Wahlen. 112-124 [doi]
- Optimal Gossiping with Unit Size Messages in Known Topology Radio NetworksFredrik Manne, Qin Xin. 125-134 [doi]