@InProceedings{dyer_et_al:DagSemProc.08201.1,
author = {Dyer, Martin E. and Jerrum, Mark and Karpinski, Marek},
title = {{08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms}},
booktitle = {Design and Analysis of Randomized and Approximation Algorithms},
pages = {1--19},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2008},
volume = {8201},
editor = {Martin E. Dyer and Mark Jerrum and Marek Karpinski},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.08201.1},
URN = {urn:nbn:de:0030-drops-15518},
doi = {10.4230/DagSemProc.08201.1},
annote = {Keywords: Randomized Algorithms, Approximation Algorithms, Optimization Problems, Measurement Problems, Approximation Complexity, Algorithmic Game Theory, Internet, Decentralized Networks, Network Design}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing