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


Dyer, Martin ; Jerrum, Mark ; Karpinski, Marek
Weitere Beteiligte (Hrsg. etc.): Martin Dyer and Mark Jerrum and Marek Karpinski

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231)

pdf-format:
DagSemRep-309.pdf (0.2 MB)


BibTeX - Entry

@TechReport{dyer_et_al:DagSemRep.309,
  author =	{Dyer, Martin and Jerrum, Mark and Karpinski, Marek},
  title =	{{Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 01231)}},
  pages =	{1--28},
  ISSN =	{1619-0203},
  year =	{2002},
  type = 	{Dagstuhl Seminar Report},
  number =	{309},
  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/15193},
  URN =		{urn:nbn:de:0030-drops-151930},
  doi =		{10.4230/DagSemRep.309},
}

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


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