DagSemProc.08201.1.pdf
- Filesize: 193 kB
- 19 pages
Document
08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 8201
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-07-16
Cite AsGet BibTex
Martin E. Dyer, Mark Jerrum, and Marek Karpinski. 08201 Abstracts Collection – Design and Analysis of Randomized and Approximation Algorithms. In Design and Analysis of Randomized and Approximation Algorithms. Dagstuhl Seminar Proceedings, Volume 8201, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08201.1
https://doi.org/10.4230/DagSemProc.08201.1
Abstract
From 11.05.08 to 16.05.08, the Dagstuhl Seminar 08201
``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 work, and ongoing work and open problems were discussed.
Abstracts of the presentations which were 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 paper are provided, if available.
Keywords
- Randomized Algorithms
- Approximation Algorithms
- Optimization Problems
- Measurement Problems
- Approximation Complexity
- Algorithmic Game Theory
- Internet
- Decentralized Networks
- Network Design
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads