DagRep.3.10.36.pdf
- Filesize: 0.88 MB
- 22 pages
Document
Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 3, Issue 10
Volume: Dagstuhl Reports, Volume 3
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-02-13
Cite AsGet BibTex
Glencora Borradaile, Philp Klein, Dániel Marx, and Claire Mathieu. Algorithms for Optimization Problems in Planar Graphs (Dagstuhl Seminar 13421). In Dagstuhl Reports, Volume 3, Issue 10, pp. 36-57, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/DagRep.3.10.36
https://doi.org/10.4230/DagRep.3.10.36
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 13421 "Algorithms for Optimization Problems in Planar Graphs". The seminar was held from October 13 to October 18, 2013. 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)
0PDF Downloads