Overview

The advent of the Internet has opened up a wealth of applications, but also given rise to a host of new problems. Many of those problems have led to - citing new research directions in mathematics and theoretical computer science, especially in the areas of combinatorics and algorithms. The Fourth Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN 2007) was organized to be a place where the latest research developments on all aspects of networking could be presented. The topics covered were diverse, with talks on strategies for searching in networks, for cleaning networks of unwanted - truders, on di?erent routing strategies, and on scheduling and load balancing. The workshop started with an invited lecture by Peter Winkler of Dartmouth College, who gave a general talk on a topic related to probability, a concept central to network modeling and managing. The afternoon opened with a short invited talk by Alejandro Lop ´ ez-Ortiz, who gave an overview of various issues in designing resilient backbone networks. CAAN 2007 took place on August 14, 2007, at Dalhousie University in Halifax, Nova Scotia, Canada, co-located with the Workshop on Algorithms and Data Structures (WADS 2007). Three previous CAAN workshops were held in Chester, UK (CAAN 2006), Waterloo, Ontario, Canada (CAAN 2005), and in Ban?, Alberta, Canada (CAAN 2004), respectively.

Full Product Details

Author:   Pawel Pralat ,  Jeannette Janssen
Publisher:   Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint:   Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition:   2007 ed.
Volume:   4852
Dimensions:   Width: 15.50cm , Height: 0.80cm , Length: 23.50cm
Weight:   0.454kg
ISBN:  

9783540772934

ISBN 10:   3540772936
Pages:   152
Publication Date:   13 December 2007
Audience:   College/higher education ,  Professional and scholarly ,  Postgraduate, Research & Scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Out of stock  
The supplier is temporarily out of stock of this item. It will be ordered for you on backorder and shipped when it becomes available.

Table of Contents

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.

Reviews

Author Information

Tab Content 6

Author Website:  

Countries Available

All regions