DagSemRep.345.pdf
- Filesize: 3.01 MB
- 25 pages
Document
Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251)
Authors
-
Part of:
Volume:
Dagstuhl Seminar Reports (DagSemRep)
Series: Dagstuhl Seminar Reports (DagSemRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2003-02-10
Cite As Get 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)
0PDF Downloads