Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

11

(FIVE YEARS 0)

H-INDEX

3

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540488224, 9783540488248

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_11 ◽

2006 ◽

pp. 125-134 ◽

Author(s):

Fredrik Manne ◽

Qin Xin

Keyword(s):

Radio Networks ◽

Download Full-text

Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case)

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_10 ◽

2006 ◽

pp. 112-124

Author(s):

Andrzej Lingas ◽

Mia Persson ◽

Martin Wahlen

Keyword(s):

Wireless Networks ◽

Euclidean Space ◽

Minimum Energy ◽

Dimensional Euclidean Space

Download Full-text

Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_6 ◽

2006 ◽

pp. 58-71 ◽

Author(s):

Guy Even ◽

Shimon Shahar

Keyword(s):

Smart Antenna ◽

Circular Arc ◽

Circular Arc Graphs

Download Full-text

Distributed Routing in Tree Networks with Few Landmarks

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_5 ◽

2006 ◽

pp. 45-57

Author(s):

Ioannis Z. Emiris ◽

Euripides Markou ◽

Aris Pagourtzis

Keyword(s):

Tree Networks ◽

Distributed Routing

Download Full-text

The Price of Anarchy in Selfish Multicast Routing

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_2 ◽

2006 ◽

pp. 5-18 ◽

Author(s):

Andreas Baltz ◽

Sandro Esquivel ◽

Lasse Kliemann ◽

Anand Srivastav

Keyword(s):

Multicast Routing ◽

Price Of Anarchy

Download Full-text

Recent Advances on Approximation Algorithms for Minimum Energy Range Assignment Problems in Ad-Hoc Wireless Networks

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_1 ◽

2006 ◽

pp. 1-4 ◽

Author(s):

David Peleg

Keyword(s):

Wireless Networks ◽

Approximation Algorithms ◽

Energy Range ◽

Ad Hoc ◽

Minimum Energy ◽

Ad Hoc Wireless Networks ◽

Assignment Problems ◽

Range Assignment ◽

Recent Advances

Download Full-text

On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_7 ◽

2006 ◽

pp. 72-85 ◽

Author(s):

Michele Flammini ◽

Mordechai Shalom ◽

Shmuel Zaks

Download Full-text

Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_3 ◽

2006 ◽

pp. 19-30

Author(s):

Davide Bilò ◽

Luciano Gualà ◽

Guido Proietti

Keyword(s):

Bicriteria Problem

Download Full-text

On the Topologies of Local Minimum Spanning Trees

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_4 ◽

2006 ◽

pp. 31-44 ◽

Author(s):

P. F. Cortese ◽

G. Di Battista ◽

F. Frati ◽

L. Grilli ◽

K. A. Lehmann ◽

...

Keyword(s):

Local Minimum ◽

Spanning Trees ◽

Minimum Spanning Trees

Download Full-text

Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP

Combinatorial and Algorithmic Aspects of Networking - Lecture Notes in Computer Science ◽

10.1007/11922377_8 ◽

2006 ◽

pp. 86-97 ◽

Author(s):

Boris Goldengorin ◽

Gerold Jäger ◽

Paul Molitor

Download Full-text