Document Open Access Logo

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

Authors Martin Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski and all authors of the abstracts in this report

PDF

File

Thumbnail PDF
PDF
DagRep.1.6.24.pdf
  • Filesize: 1.02 MB
  • 30 pages

Document Identifiers

Subject Classification

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)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get 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

Author Details

Martin Dyer
Uriel Feige
Alan M. Frieze
Marek Karpinski
and all authors of the abstracts in this report
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact