License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08201.1
URN: urn:nbn:de:0030-drops-15518
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1551/
Go to the corresponding Portal

Dyer, Martin E. ; Jerrum, Mark ; Karpinski, Marek

08201 Abstracts Collection -- Design and Analysis of Randomized and Approximation Algorithms

pdf-format:
08201_abstract_collection.1551.pdf (0.2 MB)

Abstract

From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201
``Design and Analysis of Randomized and Approximation Algorithms''
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research work, and ongoing work and open problems were discussed.
Abstracts of the presentations which were given during the seminar as well as
abstracts of seminar results and ideas are put together in this paper.
The first section describes the seminar topics and goals in general.
Links to extended abstracts or full paper are provided, if available.

BibTeX - Entry

@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/opus/volltexte/2008/1551},
  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}
}

Keywords: Randomized Algorithms, Approximation Algorithms, Optimization Problems, Measurement Problems, Approximation Complexity, Algorithmic Game Theory,
Freie Schlagwörter (englisch): Internet, Decentralized Networks, Network Design
Collection: 08201 - Design and Analysis of Randomized and Approximation Algorithms
Issue Date: 2008
Date of publication: 16.07.2008

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