Algorithms for graphs embeddable with few crossings per edge
We consider graphs that can be embedded on a surface of bounded genus such that each edge has a bounded number of crossings. We prove that many optimization problems, including MAXIMUM INDEPENDENT SET, MINIMUM VERTEX COVER, MINIMUM DOMINATING SET and many others, admit polynomial time approximation schemes when restricted to such graphs. This extends previous results by Baker [1] and Eppstein [8] to a much broader class of graphs. We also prove that for the considered class of graphs, there are balanced separators of size O (root n) where n is a number of vertices in the graph. On the negative side, we prove that it is intractable to recognize the graphs embeddable in the plane with at most one crossing per edge.
approximation algorithms baker's approximation scheme computational complexity edge crossings bounded genus graphs treewidth