Creative Commons Attribution 4.0 license (CC BY 4.0)when quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.07211.1
URN: urn:nbn:de:0030-drops-12697
URL: https://drops.dagstuhl.de/opus/volltexte/2007/1269/
Brandstädt, Andreas ; Jansen, Klaus ; Kratsch, Dieter ; Spinrad, Jeremy P.
07211 Abstracts Collection -- Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes
| pdf-format: |
|
Abstract
From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes'' was heldin 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.
BibTeX - Entry
@InProceedings{brandstadt_et_al:DagSemProc.07211.1,
author = {Brandst\"{a}dt, Andreas and Jansen, Klaus and Kratsch, Dieter and Spinrad, Jeremy P.},
title = {{07211 Abstracts Collection – Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes}},
booktitle = {Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes},
pages = {1--14},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2007},
volume = {7211},
editor = {Andreas Brandst\"{a}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2007/1269},
URN = {urn:nbn:de:0030-drops-12697},
doi = {10.4230/DagSemProc.07211.1},
annote = {Keywords: Graph theory, approximation algorithms, certifying algorithms, exact algorithms}
}
| Keywords: | Graph theory, approximation algorithms, certifying algorithms, exact algorithms | |
| Seminar: | 07211 - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes | |
| Issue date: | 2007 | |
| Date of publication: | 14.12.2007 |
