Combinatorial and Algorithmic Aspects of Networking [electronic resource] :4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers / edited by Jeannette Janssen, Paweł Prałat.
by Janssen, Jeannette [editor.]; Prałat, Paweł [editor.]; SpringerLink (Online service).
Material type:
BookSeries: Lecture Notes in Computer Science: 4852Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007.Description: online resource.ISBN: 9783540772941.Subject(s): Computer science | Computer network architectures | Computer Communication Networks | Computer software | Information systems | Mathematics | Computer Science | Information Systems Applications (incl.Internet) | Computer Systems Organization and Communication Networks | Computer Communication Networks | Algorithm Analysis and Problem Complexity | Game Theory, Economics, Social and Behav. SciencesDDC classification: 005.7 Online resources: Click here to access online | Item type | Current location | Call number | Status | Date due | Barcode |
|---|---|---|---|---|---|
| MAIN LIBRARY | QA76.76.A65 (Browse shelf) | Available |
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.
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 10 revised full papers together with 2 invited lectures presented were carefully reviewed and selected from a total of 17 submissions. This workshop brings together mathematicians, theoretical computer scientists and network specialists in a fast growing area that is an intriguing intersection of computer science, graph theory, game theory, and networks. 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.
There are no comments for this item.