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

Martin Dyer, Uriel Feige, Alan M. Frieze, Marek Karpinski, Marc Herbstritt
2011 Dagstuhl Reports  
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. Many, if not most computational tasks that arise in realistic
more » ... arios are computationally difficult, and no efficient algorithms are known that guarantee an exact (or optimal) solution on every input instance. Nevertheless, practical necessity dictates that acceptable solutions be found in a reasonable time. Two basic means for surmounting the intractability barrier are randomized computation, where the answer is optimal with high probability but not with certainty, and approximate computation, where the answer is guaranteed to be within, say, small percentage of optimality. Often, these two notions go hand-in-hand. Acknowlegement. We thank Annette Beyer and Angelika Mueller-von Brochowski for their continuous support and help in organizing this workshop. Thanks go to Mathias Hauptmann for his help in collecting abstracts of the talks and other related materials for these Proceedings.
doi:10.4230/dagrep.1.6.24 dblp:journals/dagstuhl-reports/DyerFFK11 fatcat:lb4xum4yizgo5iwrwau7d5csiy