DagRep.1.6.24.pdf
- Filesize: 1.02 MB
- 30 pages
Document
Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 1, Issue 6
Volume: Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-09-23
Cite AsGet BibTex
Martin Dyer, Uriel Feige, Alan M. Frieze, and Marek Karpinski. Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241). In Dagstuhl Reports, Volume 1, Issue 6, pp. 24-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/DagRep.1.6.24
https://doi.org/10.4230/DagRep.1.6.24
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.
Keywords
- Randomized Algorithms
- Approximation Algorithms
- Probabilistically Checkable Proofs
- Approximation Hardness
- Optimization Problems
- Counting Problems
- Streaming Algorithms
- Random Graphs
- Hypergraphs
- Probabilistic Method
- Networks
- Linear Programs
- Semidefinite Programs
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads