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
Open Access logo originally created by the Public Library of Science (PLoS)
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorProf. Dr. Markus Chimani
dc.creatorHedtke, Ivo
dc.date.accessioned2017-08-24T12:16:25Z
dc.date.available2017-08-24T12:16:25Z
dc.date.issued2017-08-24T12:16:25Z
dc.identifier.urihttps://osnadocs.ub.uni-osnabrueck.de/handle/urn:nbn:de:gbv:700-2017082416212-
dc.description.abstractThis 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.rightsNamensnennung-Keine Bearbeitung 3.0 Unported-
dc.rights.urihttp://creativecommons.org/licenses/by-nd/3.0/-
dc.subjectMinimum Genuseng
dc.subjectMaximum Planar Subgrapheng
dc.subject.ddc510 - Mathematik
dc.subject.ddc000 - Informatik, Wissen, Systeme
dc.titleMinimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation Algorithmseng
dc.typeDissertation oder Habilitation [doctoralThesis]-
thesis.locationOsnabrück-
thesis.institutionUniversität-
thesis.typeDissertation [thesis.doctoral]-
thesis.date2017-08-17-
dc.contributor.refereeProf. Dr. Matthias Müller-Hannemann
vCard.ORGFB6
Appears in Collections:FB06 - E-Dissertationen

Files in This Item:
File Description SizeFormat 
thesis_hedtke.pdfPräsentationsformat1,98 MBAdobe PDF
thesis_hedtke.pdf
Thumbnail
View/Open


This item is licensed under a Creative Commons License Creative Commons