Skip to main content
  • Conference proceedings
  • © 2006

Combinatorial and Algorithmic Aspects of Networking

Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers

Editors:

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

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 2006.

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 (11 papers)

  1. Front Matter

  2. Contributed Papers

    1. The Price of Anarchy in Selfish Multicast Routing

      • Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
      Pages 5-18
    2. Designing a Truthful Mechanism for a Spanning Arborescence Bicriteria Problem

      • Davide Bilò, Luciano Gualà, Guido Proietti
      Pages 19-30
    3. On the Topologies of Local Minimum Spanning Trees

      • P. F. Cortese, G. Di Battista, F. Frati, L. Grilli, K. A. Lehmann, G. Liotta et al.
      Pages 31-44
    4. Distributed Routing in Tree Networks with Few Landmarks

      • Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis
      Pages 45-57
    5. On Minimizing the Number of ADMs – Tight Bounds for an Algorithm Without Preprocessing

      • Michele Flammini, Mordechai Shalom, Shmuel Zaks
      Pages 72-85
    6. Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP

      • Boris Goldengorin, Gerold Jäger, Paul Molitor
      Pages 86-97
    7. Acyclic Type-of-Relationship Problems on the Internet

      • Sven Kosub, Moritz G. Maaß, Hanjo Täubig
      Pages 98-111
  3. Back Matter

Other Volumes

  1. Combinatorial and Algorithmic Aspects of Networking

Editors and Affiliations

  • Department of Computer Science, University of Leicester, Leicester, UK

    Thomas Erlebach

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