Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms
Please use this identifier to cite or link to this item:
https://osnadocs.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2017082416212
https://osnadocs.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2017082416212
| Title: | Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms |
| Authors: | Hedtke, Ivo |
| Thesis advisor: | Prof. Dr. Markus Chimani |
| Thesis referee: | Prof. Dr. Matthias Müller-Hannemann |
| Abstract: | 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. |
| URL: | https://osnadocs.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2017082416212 |
| Subject Keywords: | Minimum Genus; Maximum Planar Subgraph |
| Issue Date: | 24-Aug-2017 |
| License name: | Namensnennung-Keine Bearbeitung 3.0 Unported |
| License url: | http://creativecommons.org/licenses/by-nd/3.0/ |
| Type of publication: | Dissertation oder Habilitation [doctoralThesis] |
| Appears in Collections: | FB06 - E-Dissertationen |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| thesis_hedtke.pdf | Präsentationsformat | 1,98 MB | Adobe PDF | thesis_hedtke.pdf  View/Open |
This item is licensed under a
Creative Commons License
