2026-07-21T19:18:20Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3258 2024-03-06T10:25:43Z ddc:004 open_access

Design and Analysis of Randomized and Approximation Algorithms (Dagstuhl Seminar 11241) Dyer, Martin Feige, Uriel Frieze, Alan M. Karpinski, Marek 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 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Martin Dyer and Uriel Feige and Alan M. Frieze and Marek Karpinski 2011 Is Part Of Dagstuhl Reports, Volume 1, Issue 6 (2011) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.1.6.24 urn:nbn:de:0030-drops-32585 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.1.6.24 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode