Skip to main content
  • Conference proceedings
  • © 2005

Combinatorial and Algorithmic Aspects of Networking

First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers

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

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

Conference series link(s): CAAN: Workshop on Combinatorial and Algorithmic Aspects of Networking

Conference proceedings info: CAAN 2004.

Buy it now

Buying options

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

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

Table of contents (19 papers)

  1. Front Matter

  2. Workshop Proceedings

    1. Aggregating Correlated Data in Sensor Networks

      • M. Enachescu, A. Goel, R. Govindan, R. Motwani
      Pages 1-2
    2. The Efficiency of Optimal Taxes

      • George Karakostas, Stavros G. Kolliopoulos
      Pages 3-12
    3. Congestion Games, Load Balancing, and Price of Anarchy

      • Anshul Kothari, Subhash Suri, Csaba D. Tóth, Yunhong Zhou
      Pages 13-27
    4. Cuts and Disjoint Paths in the Valley-Free Path Model of Internet BGP Routing

      • Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinović
      Pages 49-62
    5. String Matching on the Internet

      • Hervé Brönnimann, Nasir Memon, Kulesh Shanmugasundaram
      Pages 75-89
    6. k-Robust Single-Message Transmission

      • André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi
      Pages 90-101
    7. The External Network Problem with Edge- or Arc-Connectivity Requirements

      • Jan van den Heuvel, Matthew Johnson
      Pages 114-126
    8. Bipartite Graphs as Models of Complex Networks

      • Jean-Loup Guillaume, Matthieu Latapy
      Pages 127-139
    9. Traceroute-Like Exploration of Unknown Networks: A Statistical Analysis

      • Luca Dall’Asta, Ignacio Alvarez-Hamelin, Alain Barrat, Alexei Vázquez, Alessandro Vespignani
      Pages 140-153
  3. Survey Articles

    1. Algorithmic Foundations of the Internet:Foreword

      • Alejandro López-Ortiz
      Pages 155-158
    2. A Survey of Models of the Web Graph

      • Anthony Bonato
      Pages 159-172
    3. You Can Get There from Here: Routing in the Internet

      • Jean-Charles Grégoire, Angèle M. Hamel
      Pages 173-182
    4. Search Engines and Web Information Retrieval

      • Alejandro López-Ortiz
      Pages 183-191
    5. Algorithmic Foundations of the Internet: Roundup

      • Alejandro López-Ortiz
      Pages 192-204

Other Volumes

  1. Combinatorial and Algorithmic Aspects of Networking

Editors and Affiliations

  • Cheriton School of Computer Science, University of Waterloo, Waterloo, Canada

    Alejandro López-Ortiz

  • Department of Physics and Computer Science, Wilfrid Laurier University, Waterloo, Canada

    Angèle M. Hamel

Bibliographic Information

Buy it now

Buying options

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