License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.04221.1
URN: urn:nbn:de:0030-drops-2732
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/273/
Go to the corresponding Portal

Brandstädt, Andreas ; Corneil, Derek G. ; Jansen, Klaus ; Spinrad, Jeremy P.

04221 Abstracts Collection -- Robust and Approximative Algorithms on Particular Graph Classes

pdf-format:
04221_abstracts_collection.273.pdf (0.2 MB)

Abstract

From 23.05.04 to 28.05.04, the Dagstuhl Seminar
04221 ``Robust and Approximative 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{brandstadt_et_al:DagSemProc.04221.1,
  author =	{Brandst\"{a}dt, Andreas and Corneil, Derek G. and Jansen, Klaus and Spinrad, Jeremy P.},
  title =	{{04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes}},
  booktitle =	{Robust and Approximative Algorithms an Particular Graph Classes},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4221},
  editor =	{Andreas Brandst\"{a}dt and Derek G. Corneil and Klaus Jansen and Jeremy P. Spinrad},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2005/273},
  URN =		{urn:nbn:de:0030-drops-2732},
  doi =		{10.4230/DagSemProc.04221.1},
  annote =	{Keywords: Graph algorithms, graph classes, graph algorithms, robust algorithms, approximation}
}

Keywords: Graph algorithms, graph classes, graph algorithms, robust algorithms, approximation
Collection: 04221 - Robust and Approximative Algorithms an Particular Graph Classes
Issue Date: 2005
Date of publication: 19.09.2005

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI