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

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540772934, 9783540772941

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Selfish Routing and Path Coloring in All-Optical Networks

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

10.1007/978-3-540-77294-1_8 ◽

2007 ◽

pp. 71-84 ◽

Cited By ~ 3

Author(s):

Ioannis Milis ◽

Aris Pagourtzis ◽

Katerina Potika

Keyword(s):

Optical Networks ◽

Selfish Routing ◽

All Optical ◽

Path Coloring

Download Full-text

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design

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

10.1007/978-3-540-77294-1_3 ◽

2007 ◽

pp. 3-12 ◽

Cited By ~ 4

Author(s):

Alejandro López-Ortiz

Keyword(s):

Load Balancing

Download Full-text

Nonadaptive Selfish Routing with Online Demands

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

10.1007/978-3-540-77294-1_5 ◽

2007 ◽

pp. 27-45 ◽

Cited By ~ 6

Author(s):

Tobias Harks ◽

László A. Végh

Keyword(s):

Selfish Routing

Download Full-text

Combinatorial Algorithms for Listing Paths in Minimal Change Order

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

10.1007/978-3-540-77294-1_11 ◽

2007 ◽

pp. 112-130 ◽

Cited By ~ 3

Author(s):

Zareen Alamgir ◽

Sarmad Abbasi

Keyword(s):

Minimal Change ◽

Combinatorial Algorithms ◽

Change Order

Download Full-text

Valiant Load Balancing, Benes Networks and Resilient Backbone Design

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

10.1007/978-3-540-77294-1_2 ◽

2007 ◽

pp. 2-2 ◽

Cited By ~ 1

Author(s):

Alejandro López-Ortiz

Keyword(s):

Load Balancing ◽

Benes Networks

Download Full-text

Luck vs. Skill

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

10.1007/978-3-540-77294-1_1 ◽

2007 ◽

pp. 1-1

Author(s):

Peter Winkler

Download Full-text

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

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

10.1007/978-3-540-77294-1_4 ◽

2007 ◽

pp. 13-26 ◽

Cited By ~ 5

Author(s):

Margaret-Ellen Messinger ◽

Paweł Prałat ◽

Richard J. Nowakowski ◽

Nicholas Wormald

Keyword(s):

Greedy Algorithm ◽

Regular Graphs

Download Full-text

Vertex Pursuit Games in Stochastic Network Models

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

10.1007/978-3-540-77294-1_6 ◽

2007 ◽

pp. 46-56 ◽

Cited By ~ 1

Author(s):

Anthony Bonato ◽

Paweł Prałat ◽

Changping Wang

Keyword(s):

Network Models ◽

Stochastic Network ◽

Pursuit Games

Download Full-text

Improving Topological Routing in N2R Networks

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

10.1007/978-3-540-77294-1_12 ◽

2007 ◽

pp. 131-148 ◽

Cited By ~ 1

Author(s):

Jose M. Gutierrez Lopez ◽

Ruben Cuevas Rumin ◽

Jens M. Pedersen ◽

Ole B. Madsen

Download Full-text

Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP

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

10.1007/978-3-540-77294-1_10 ◽

2007 ◽

pp. 99-111 ◽

Cited By ~ 6

Author(s):

Dirk Richter ◽

Boris Goldengorin ◽

Gerold Jäger ◽

Paul Molitor

Download Full-text

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

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Selfish Routing and Path Coloring in All-Optical Networks

Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design

Nonadaptive Selfish Routing with Online Demands

Combinatorial Algorithms for Listing Paths in Minimal Change Order

Valiant Load Balancing, Benes Networks and Resilient Backbone Design

Luck vs. Skill

Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

Vertex Pursuit Games in Stochastic Network Models

Improving Topological Routing in N2R Networks

Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP

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