Document Open Access Logo

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

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



PDF
Thumbnail PDF

File

DagSemProc.04221.1.pdf
  • Filesize: 166 kB
  • 10 pages

Document Identifiers

Author Details

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

Cite AsGet BibTex

Andreas Brandstädt, Derek G. Corneil, Klaus Jansen, and Jeremy P. Spinrad. 04221 Abstracts Collection – Robust and Approximative Algorithms on Particular Graph Classes. In Robust and Approximative Algorithms an Particular Graph Classes. Dagstuhl Seminar Proceedings, Volume 4221, pp. 1-10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2005)
https://doi.org/10.4230/DagSemProc.04221.1

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.
Keywords
  • Graph algorithms
  • graph classes
  • graph algorithms
  • robust algorithms
  • approximation

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail