DagSemProc.05201.1.pdf
- Filesize: 266 kB
- 21 pages
Document
05201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 5201
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2005-11-06
Cite AsGet BibTex
Martin Dyer, Mark Jerrum, and Marek Karpinski. 05201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms. In Design and Analysis of Randomized and Approximation Algorithms. Dagstuhl Seminar Proceedings, Volume 5201, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.05201.1
https://doi.org/10.4230/DagSemProc.05201.1
Abstract
From 15.05.05 to 20.05.05, the Dagstuhl Seminar 05201 ``Design and Analysis of Randomized and Approximation Algorithms'' was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
Keywords
- Randomized Algorithms
- Approximation Algorithms
- Optimization Problems
- Measurement Problems
- Decentralized Networks
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads