License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.1.6.24
URN: urn:nbn:de:0030-drops-32585
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2011/3258/
Go back to Dagstuhl Reports

Dyer, Martin ; Feige, Uriel ; Frieze, Alan M. ; Karpinski, Marek
Weitere Beteiligte (Hrsg. etc.): Martin Dyer and Uriel Feige and Alan M. Frieze and Marek Karpinski

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

pdf-format:
dagrep_v001_i006_p024_s11241.pdf (1 MB)

Abstract

The Dagstuhl Seminar on ``Design and Analysis of Randomized and Approximation Algorithms'' (Seminar 11241) was held at Schloss Dagstuhl between June 13--17, 2011.
There were 26 regular talks and several informal and open problem session contributions presented during this seminar. Abstracts of the presentations have been put together in this seminar proceedings document together with some links to extended abstracts and full papers.

BibTeX - Entry

@Article{dyer_et_al:DR:2011:3258,
  author =	{Martin Dyer and Uriel Feige and Alan M. Frieze and Marek Karpinski},
  title =	{{Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)}},
  pages =	{24--53},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2011},
  volume =	{1},
  number =	{6},
  editor =	{Martin Dyer and Uriel Feige and Alan M. Frieze and Marek Karpinski},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3258},
  URN =		{urn:nbn:de:0030-drops-32585},
  doi =		{10.4230/DagRep.1.6.24},
  annote =	{Keywords: Randomized Algorithms, Approximation Algorithms, Probabilistically Checkable Proofs, Approximation Hardness, Optimization Problems, Counting Problems,}
}

Keywords: Randomized Algorithms, Approximation Algorithms, Probabilistically Checkable Proofs, Approximation Hardness, Optimization Problems, Counting Problems,
Freie Schlagwörter (englisch): Streaming Algorithms, Random Graphs, Hypergraphs, Probabilistic Method, Networks, Linear Programs, Semidefinite Programs
Collection: Dagstuhl Reports, Volume 1, Issue 6
Issue Date: 2011
Date of publication: 23.09.2011

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