Combinatorial and Algorithmic Aspects of Networking 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers /
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 W...
| Corporate Author: | |
|---|---|
| Other Authors: | , |
| Language: | English |
| Published: |
Berlin, Heidelberg :
Springer Berlin Heidelberg : Imprint: Springer,
2007.
|
| Edition: | 1st ed. 2007. |
| Series: | Computer Communication Networks and Telecommunications ;
4852 |
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-3-540-77294-1 |
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.