4. CAAN 2007:
Halifax,
Canada
Jeannette C. M. Janssen, Pawel Pralat (Eds.):
Combinatorial and Algorithmic Aspects of Networking, 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007. Revised Papers.
Lecture Notes in Computer Science 4852 Springer 2007, ISBN 978-3-540-77293-4 
Invited Lectures (Abstracts)
Contributed Papers
- Alejandro López-Ortiz:
Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design.
3-12
- Margaret-Ellen Messinger, Pawel Pralat, Richard J. Nowakowski, Nicholas C. Wormald:
Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm.
13-26
- Tobias Harks, László A. Végh:
Nonadaptive Selfish Routing with Online Demands.
27-45
- Anthony Bonato, Pawel Pralat, Changping Wang:
Vertex Pursuit Games in Stochastic Network Models.
46-56
- Leah Epstein, Rob van Stee:
Preemptive Scheduling on Selfish Machines.
57-70
- Ioannis Milis, Aris Pagourtzis, Katerina Potika:
Selfish Routing and Path Coloring in All-Optical Networks.
71-84
- Guillermo De Ita Luna, Aurelio López-López:
A Worst-Case Time Upper Bound for Counting the Number of Independent Sets.
85-98
- Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor:
Improving the Efficiency of Helsgaun's Lin-Kernighan Heuristic for the Symmetric TSP.
99-111
- Zareen Alamgir, Sarmad Abbasi:
Combinatorial Algorithms for Listing Paths in Minimal Change Order.
112-130
- José M. Gutiérrez López, Rubén Cuevas Rumín, Jens Myrup Pedersen, Ole Brun Madsen:
Improving Topological Routing in N2R Networks.
131-148
Last update Tue Feb 14 03:49:52 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
