Search the Dagstuhl Website
Looking for information on the websites of the individual seminars? - Then please:
Not found what you are looking for? - Some of our services have separate websites, each with its own search option. Please check the following list:
Schloss Dagstuhl - LZI - Logo
Schloss Dagstuhl Services
Within this website:
External resources:
  • DOOR (for registering your stay at Dagstuhl)
  • DOSA (for proposing future Dagstuhl Seminars or Dagstuhl Perspectives Workshops)
Within this website:
External resources:
Within this website:
External resources:
  • the dblp Computer Science Bibliography

Dagstuhl Seminar 02251

Approximation and Randomized Algorithms in Communication Networks

( Jun 16 – Jun 21, 2002 )

Please use the following short url to reference this page:



The recent progress in network technologies and availability of large distributed computer systems has increased the need for efficient algorithms for solving the diverse optimization problems that arise in the management and usage of communication networks. Technological developments in communication networks, like broad-band, all-optical, and ATM networks have made this area very interesting and important in recent years. They have also created new research directions and projects. The objectives of this seminar are of both theoretical and practical significance. The seminar aims to contribute to the theory of approximation, randomized, and on-line algorithms for problems arising in communication networks. It also has as a goal to explore the use of this theory in the solution of real world applications and in the development of practical algorithmic tools, thus fostering the cooperation among theoretical and practical researchers in this field.

The topics of the seminar include: routing and communication in networks, design of high performance networks, wavelength routing in optical networks, ATM network problems, quality of service, robustness issues, frequency assignment in radio networks, time and resource constrained scheduling, scheduling with communication delays, load balancing, and resource allocation.

The seminar is intended to bring together researchers from different areas in combinatorial optimization and from applications. It will support the collaboration between researchers in Computer Science, Engineering, Mathematics, and related areas.

The seminar has the following goals:

  • pose new optimization problems arising from applications in communication networks,
  • design improved approximation algorithms for optimization problems in communication networks,
  • study new algorithmic methods using randomization, linear, and nonlinear programming,
  • discuss the practical implementation of different techniques and methods proposed for solving network communication problems,
  • exchange information on recent research and stimulate further research in this area.

  • Foto Afrati (National Technical University of Athens, GR) [dblp]
  • Susanne Albers (Universität Freiburg, DE) [dblp]
  • Eric Angel (University of Evry, FR)
  • Vincenzo Auletta (University of Salerno, IT)
  • Evripidis Bampis (University of Evry, FR)
  • Luca Becchetti (Sapienza University of Rome, IT) [dblp]
  • Ioannis Caragiannis (CTI & University of Patras, GR) [dblp]
  • Stephan Eidenbenz (ETH Zürich, CH)
  • Thomas Erlebach (University of Leicester, GB) [dblp]
  • Aleksei Fishkin (MPI für Informatik - Saarbrücken, DE)
  • Fedor V. Fomin (University of Bergen, NO) [dblp]
  • Martin Fürer (Pennsylvania State University - University Park, US) [dblp]
  • Clemente Galdi (CTI & University of Patras, GR)
  • Luisa Gargano (University of Salerno, IT)
  • Leszek A. Gasieniec (University of Liverpool, GB)
  • Mikael Hammar (University of Salerno, IT)
  • Klaus Jansen (Universität Kiel, DE) [dblp]
  • Christos Kaklamanis (CTI & University of Patras, GR) [dblp]
  • Stavros Kolliopoulos (McMaster University - Hamilton, CA)
  • Alexander Kononov (University of Evry, FR)
  • Claire Mathieu (Brown University - Providence, US) [dblp]
  • Marios Mavronicolas (University of Cyprus, CY)
  • Wolfgang Merkle (Universität Heidelberg, DE) [dblp]
  • Ioannis Milis (Athens University of Economics and Business, GR)
  • Aristeidis Pagourtzis (ETH Zürich, CH)
  • Giuseppe Persiano (University of Salerno, IT) [dblp]
  • Prabhakar Raghavan (Verity Inc. - Sunnyvale, US)
  • Hervé Rivano (INRIA Sophia Antipolis - Méditerranée, FR)
  • Adi Rosén (Technion - Haifa, IL) [dblp]
  • Tim Roughgarden (Stanford University, US) [dblp]
  • Ingo Schiermeyer (TU Bergakademie Freiberg, DE) [dblp]
  • Martin Skutella (TU Dortmund, DE) [dblp]
  • Roberto Solis-Oba (University of Western Ontario - London, CA) [dblp]
  • Frits C. R. Spieksma (Katholieke Universiteit Leuven, BE) [dblp]
  • Paul Spirakis (CTI - Rion, GR) [dblp]
  • Anand Srivastav (Christian-Albrechts-Universität zu Kiel, DE) [dblp]
  • Berthold Vöcking (RWTH Aachen, DE) [dblp]
  • Gordon T. Wilfong (Bell Labs - Murray Hill, US)
  • Alexander Wolff (KIT - Karlsruher Institut für Technologie, DE) [dblp]
  • Neal E. Young (Akamai Technologies - Cambridge, US)
  • Hu Zhang (Universität Kiel, DE)