Skip to main content
SpringerLink
Log in

Combinatorial and Algorithmic Aspects of Networking

4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Jeannette Janssen
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Paweł Prałat
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4852)

Part of the book sub series: Computer Communication Networks and Telecommunications (LNCCN)

Included in the following conference series:

Conference proceedings info: CAAN 2007.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (12 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Lectures (Abstracts)

    1. Luck vs. Skill

      • Peter Winkler
      Pages 1-1

    2. Valiant Load Balancing, Benes Networks and Resilient Backbone Design

      • Alejandro López-Ortiz
      Pages 2-2

  3. Contributed Papers

    1. Valiant Load Balancing, Capacity Provisioning and Resilient Backbone Design

      • Alejandro López-Ortiz
      Pages 3-12

    2. Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm

      • Margaret-Ellen Messinger, Paweł Prałat, Richard J. Nowakowski, Nicholas Wormald
      Pages 13-26

    3. Nonadaptive Selfish Routing with Online Demands

      • Tobias Harks, László A. Végh
      Pages 27-45

    4. Vertex Pursuit Games in Stochastic Network Models

      • Anthony Bonato, Paweł Prałat, Changping Wang
      Pages 46-56

    5. Preemptive Scheduling on Selfish Machines

      • Leah Epstein, Rob van Stee
      Pages 57-70

    6. Selfish Routing and Path Coloring in All-Optical Networks

      • Ioannis Milis, Aris Pagourtzis, Katerina Potika
      Pages 71-84

    7. A Worst-Case Time Upper Bound for Counting the Number of Independent Sets

      • Guillermo De Ita, Aurelio López-López
      Pages 85-98

    8. Improving the Efficiency of Helsgaun’s Lin-Kernighan Heuristic for the Symmetric TSP

      • Dirk Richter, Boris Goldengorin, Gerold Jäger, Paul Molitor
      Pages 99-111

    9. Combinatorial Algorithms for Listing Paths in Minimal Change Order

      • Zareen Alamgir, Sarmad Abbasi
      Pages 112-130

    10. Improving Topological Routing in N2R Networks

      • Jose M. Gutierrez Lopez, Ruben Cuevas Rumin, Jens M. Pedersen, Ole B. Madsen
      Pages 131-148

  4. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Combinatorial and Algorithmic Aspects of Networking

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation