DagRep.6.5.94.pdf
- Filesize: 1.06 MB
- 20 pages
Document
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 16221)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 6, Issue 5
Volume: Dagstuhl Reports, Volume 6
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-11-15
Cite As Get 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.
Subject Classification
Keywords
- Algorithms
- planar graphs
- theory
- approximation
- fixed-parameter tractable
- network flow
- network design
- kernelization
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads