Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)

Authors Jeff Erickson, Philip N. Klein, Dániel Marx, Claire Mathieu and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.6.5.94.pdf
  • Filesize: 1.06 MB
  • 20 pages

Document Identifiers

Author Details

Jeff Erickson
Philip N. Klein
Dániel Marx
Claire Mathieu
and all authors of the abstracts in this report

Cite AsGet BibTex

Jeff Erickson, Philip N. Klein, Dániel Marx, and Claire Mathieu. Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221). In Dagstuhl Reports, Volume 6, Issue 5, pp. 94-113, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/DagRep.6.5.94

Abstract

This report documents the program and the outcomes of Dagstuhl Seminar 16221 “Algorithms for Optimization Problems in Planar Graphs”. The seminar was held from May 29 to June 3, 2016. This report contains abstracts for the recent developments in planar graph algorithms discussed during the seminar as well as summaries of open problems in this area of research.
Keywords
  • Algorithms
  • planar graphs
  • theory
  • approximation
  • fixed-parameter tractable
  • network flow
  • network design
  • kernelization

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