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
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Prof. Dr. Markus Chimani | |
dc.creator | Hedtke, Ivo | |
dc.date.accessioned | 2017-08-24T12:16:25Z | |
dc.date.available | 2017-08-24T12:16:25Z | |
dc.date.issued | 2017-08-24T12:16:25Z | |
dc.identifier.uri | https://osnadocs.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2017082416212 | - |
dc.description.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. | eng |
dc.rights | Namensnennung-Keine Bearbeitung 3.0 Unported | - |
dc.rights.uri | http://creativecommons.org/licenses/by-nd/3.0/ | - |
dc.subject | Minimum Genus | eng |
dc.subject | Maximum Planar Subgraph | eng |
dc.subject.ddc | 510 - Mathematik | |
dc.subject.ddc | 000 - Informatik, Wissen, Systeme | |
dc.title | Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithms | eng |
dc.type | Dissertation oder Habilitation [doctoralThesis] | - |
thesis.location | Osnabrück | - |
thesis.institution | Universität | - |
thesis.type | Dissertation [thesis.doctoral] | - |
thesis.date | 2017-08-17 | - |
dc.contributor.referee | Prof. Dr. Matthias Müller-Hannemann | |
vCard.ORG | FB6 | |
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