Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251)

Authors Evripidis Bampis, Klaus Jansen, Giuseppe Persiano, Roberto Solis-Oba, Gordon T. Wilfong



PDF
Thumbnail PDF

File

DagSemRep.345.pdf
  • Filesize: 3.01 MB
  • 25 pages

Document Identifiers

Author Details

Evripidis Bampis
Klaus Jansen
Giuseppe Persiano
Roberto Solis-Oba
Gordon T. Wilfong

Cite AsGet BibTex

Evripidis Bampis, Klaus Jansen, Giuseppe Persiano, Roberto Solis-Oba, and Gordon T. Wilfong. Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251). Dagstuhl Seminar Report 345, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2003)
https://doi.org/10.4230/DagSemRep.345

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail