Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642022494, 9783642022500

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimization of OSPF Routing in IP Networks

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_8 ◽

2009 ◽

pp. 199-240 ◽

Cited By ~ 6

Author(s):

Andreas Bley ◽

Bernard Fortz ◽

Eric Gourdin ◽

Kaj Holmberg ◽

Olivier Klopfenstein ◽

...

Keyword(s):

Ip Networks

Download Full-text

Routing and Label Space Reduction in Label Switching Networks

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_4 ◽

2009 ◽

pp. 119-136

Author(s):

Fernando Solano ◽

Luis Fernando Caro ◽

Thomas Stidsen ◽

Dimitri Papadimitriou

Keyword(s):

Switching Networks ◽

Label Switching ◽

Space Reduction

Download Full-text

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_3 ◽

2009 ◽

pp. 95-118 ◽

Cited By ~ 2

Author(s):

Sebastian Orlowski ◽

Christian Raack ◽

Arie M. C. A. Koster ◽

Georg Baier ◽

Thomas Engel ◽

...

Keyword(s):

Network Design ◽

Branch And Cut ◽

Design Problems ◽

Network Design Problems

Download Full-text

Permutation Routing and (ℓ, k)-Routing on Plane Grids

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_10 ◽

2009 ◽

pp. 265-279

Author(s):

Ignasi Sau ◽

Janez Žerovnik

Keyword(s):

Permutation Routing

Download Full-text

Graphs and Algorithms in Communication Networks on Seven League Boots

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_1 ◽

2009 ◽

pp. 1-59

Author(s):

Arie M. C. A. Koster ◽

Xavier Muñoz

Keyword(s):

Communication Networks

Download Full-text

Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_6 ◽

2009 ◽

pp. 163-178 ◽

Cited By ~ 1

Author(s):

Mirosław Klinkowski ◽

Marian Marciniak ◽

Michał Pióro

Keyword(s):

Optical Burst Switching ◽

Switching Networks ◽

Burst Switching ◽

Routing Optimization ◽

Optical Burst Switching Networks ◽

Optical Burst

Download Full-text

Topology Control and Routing in Ad Hoc Networks

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_16 ◽

2009 ◽

pp. 401-418

Author(s):

Lenka Carr-Motyckova ◽

Alfredo Navarra ◽

Tomas Johansson ◽

Walter Unger

Keyword(s):

Ad Hoc Networks ◽

Topology Control ◽

Ad Hoc ◽

Hoc Networks

Download Full-text

Time-Efficient Broadcast in Radio Networks

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_12 ◽

2009 ◽

pp. 311-334 ◽

Cited By ~ 1

Author(s):

David Peleg ◽

Tomasz Radzik

Keyword(s):

Radio Networks

Download Full-text

Traffic Grooming: Combinatorial Results and Practical Resolutions

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_2 ◽

2009 ◽

pp. 63-94 ◽

Cited By ~ 2

Author(s):

Tibor Cinkler ◽

David Coudert ◽

Michele Flammini ◽

Gianpiero Monaco ◽

Luca Moscardelli ◽

...

Keyword(s):

Traffic Grooming

Download Full-text

Game-Theoretic Approaches to Optimization Problems in Communication Networks

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks ◽

10.1007/978-3-642-02250-0_9 ◽

2009 ◽

pp. 241-263 ◽

Cited By ~ 1

Author(s):

Vittorio Bilò ◽

Ioannis Caragiannis ◽

Angelo Fanelli ◽

Michele Flammini ◽

Christos Kaklamanis ◽

...

Keyword(s):

Communication Networks ◽

Optimization Problems ◽

Game Theoretic

Download Full-text

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication NetworksLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Optimization of OSPF Routing in IP Networks

Routing and Label Space Reduction in Label Switching Networks

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems

Permutation Routing and (ℓ, k)-Routing on Plane Grids

Graphs and Algorithms in Communication Networks on Seven League Boots

Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach

Topology Control and Routing in Ad Hoc Networks

Time-Efficient Broadcast in Radio Networks

Traffic Grooming: Combinatorial Results and Practical Resolutions

Game-Theoretic Approaches to Optimization Problems in Communication Networks

Texts in Theoretical Computer Science. An EATCS Series - Graphs and Algorithms in Communication Networks
Latest Publications