Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Markus Chimani, Ivo Hedtke, Tilo Wiedera. Limits of Greedy Approximation Algorithms for the Maximum Planar Subgraph Problem. In Veli Mäkinen, Simon J. Puglisi, Leena Salmela, editors, Combinatorial Algorithms - 27th International Workshop, IWOCA 2016, Helsinki, Finland, August 17-19, 2016, Proceedings. Volume 9843 of Lecture Notes in Computer Science, pages 334-346, Springer, 2016. [doi]

The following publications are possibly variants of this publication:

Minimum Genus and Maximum Planar Subgraph: Exact Algorithms and General Limits of Approximation AlgorithmsIvo Hedtke. PhD thesis, University of Osnabrück, Germany, 2017. [doi]

runs on WebDSL