Combinatorial and Algorithmic Aspects of Networking

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

  • Thomas Erlebach
Conference proceedings CAAN 2006
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4235)

Table of contents

  1. Front Matter
  2. Invited Lecture

  3. Contributed Papers

    1. Andreas Baltz, Sandro Esquivel, Lasse Kliemann, Anand Srivastav
      Pages 5-18
    2. Davide Bilò, Luciano Gualà, Guido Proietti
      Pages 19-30
    3. P. F. Cortese, G. Di Battista, F. Frati, L. Grilli, K. A. Lehmann, G. Liotta et al.
      Pages 31-44
    4. Ioannis Z. Emiris, Euripides Markou, Aris Pagourtzis
      Pages 45-57
    5. Michele Flammini, Mordechai Shalom, Shmuel Zaks
      Pages 72-85
    6. Boris Goldengorin, Gerold Jäger, Paul Molitor
      Pages 86-97
    7. Sven Kosub, Moritz G. Maaß, Hanjo Täubig
      Pages 98-111
  4. Back Matter

About these proceedings

Keywords

Broadcast Internet QoS Roadcasting Routing Topologie approximation algorithms combinatorics communication networks complex networks data stream analysis economics game theory geometric routing peer-to-peer systems

Editors and affiliations

  • Thomas Erlebach
    • 1
  1. 1.Department of Computer ScienceUniversity of LeicesterLeicesterUK

Bibliographic information

  • DOI https://doi.org/10.1007/11922377
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-48822-4
  • Online ISBN 978-3-540-48824-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book