License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-12697
URL: http://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:
Dokument 1.pdf (224 KB)


Abstract

From May 20 to May 25, 2007, the Dagstuhl Seminar 07211 ``Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes'' 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.

BibTeX - Entry

@InProceedings{brandstdt_et_al:DSP:2007:1269,
  author =	{Andreas Brandst{\"a}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad},
  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},
  year =	{2007},
  editor =	{Andreas Brandst{\"a}dt and Klaus Jansen and Dieter Kratsch and Jeremy P. Spinrad},
  number =	{07211},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2007/1269},
  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


DROPS-Home | Fulltext Search | Imprint Published by LZI