Combinatorial and Algorithmic Aspects of Networking : 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers

Jeannette Janssen

ISBN 10: 3540772936 / ISBN 13: 9783540772934

Editore: Springer Berlin Heidelberg, 2007

Riguardo questo articolo

Druck auf Anfrage Neuware - Printed after ordering.

Codice articolo 9783540772934

Dati bibliografici

• Titolo: Combinatorial and Algorithmic Aspects of Networking : 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers
• Editore: Springer Berlin Heidelberg
• Data di pubblicazione: 2007
• Lingua: Inglese
• ISBN 10: 3540772936
• ISBN 13: 9783540772934
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 9 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 9 millimetri di profondità
• Peso: 254 grammi

Descrizione articolo

Riassunto

This book constitutes the thoroughly refereed post-conference proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007, held in Halifax, Canada, in August 2007, co-located with the 10th Workshop on Algorithms and Data Structures, WADS 2007. The main focus is on strategies for searching in networks, and for cleaning networks of unwanted intruders, on different routing strategies, and on scheduling and load balancing.

Contenuti

Invited Lectures (Abstracts).- Luck vs. Skill.- Valiant Load Balancing, Benes Networks and Resilient Backbone Design.- Contributed Papers.- Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.- Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.- Nonadaptive Selfish Routing with Online Demands.- Vertex Pursuit Games in Stochastic Network Models.- Preemptive Scheduling on Selfish Machines.- Selfish Routing and Path Coloring in All-Optical Networks.- A Worst-Case Time Upper Bound for Counting the Number of Independent Sets.- Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP.- Combinatorial Algorithms for Listing Paths in Minimal Change Order.- Improving Topological Routing in N2R Networks.