License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemRep.345
URN: urn:nbn:de:0030-drops-152265
URL: https://drops.dagstuhl.de/opus/volltexte/2021/15226/
 


Bampis, Evripidis ; Jansen, Klaus ; Persiano, Giuseppe ; Solis-Oba, Roberto ; Wilfong, Gordon T.
Weitere Beteiligte (Hrsg. etc.): Evripidis Bampis and Klaus Jansen and Giuseppe Persiano and Roberto Solis-Oba and Gordon T. Wilfong

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

pdf-format:
DagSemRep-345.pdf (3 MB)


BibTeX - Entry

@TechReport{bampis_et_al:DagSemRep.345,
  author =	{Bampis, Evripidis and Jansen, Klaus and Persiano, Giuseppe and Solis-Oba, Roberto and Wilfong, Gordon T.},
  title =	{{Approximation and Randomized Algorithms in Communication Networks (Dagstuhl Seminar 02251)}},
  pages =	{1--25},
  ISSN =	{1619-0203},
  year =	{2003},
  type = 	{Dagstuhl Seminar Report},
  number =	{345},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2021/15226},
  URN =		{urn:nbn:de:0030-drops-152265},
  doi =		{10.4230/DagSemRep.345},
}

Collection: Dagstuhl Seminar Reports
Issue Date: 2021
Date of publication: 10.02.2003


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI