This thesis introduces exact (ILP- and SAT/PBS-based) algorithms for the Minimum Genus Problem and the Maximum Planar Subgraph Problem. It also considers general limits of approximation algorithms for the Maximum Planar Subgraph Problem.
| Identifer | oai:union.ndltd.org:uni-osnabrueck.de/oai:repositorium.ub.uni-osnabrueck.de:urn:nbn:de:gbv:700-2017082416212 |
| Date | 24 August 2017 |
| Creators | Hedtke, Ivo |
| Contributors | Prof. Dr. Markus Chimani, Prof. Dr. Matthias Müller-Hannemann |
| Source Sets | Universität Osnabrück |
| Language | English |
| Detected Language | English |
| Type | doc-type:doctoralThesis |
| Format | application/pdf, application/zip |
| Rights | Namensnennung-Keine Bearbeitung 3.0 Unported, http://creativecommons.org/licenses/by-nd/3.0/ |
Page generated in 0.0021 seconds