Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation
We generalize the linear-time shortest-paths algorithm for planar graphs with nonnegative edge-weights of Henzinger etal.(1994) to work for any proper minor-closed class of graphs. We argue that their algorithm can not be adapted by standard methods to all proper minor-closed classes. By using recent deep results in graph minor theory, we show how to construct an appropriate recursive division in linear time for any graph excluding a fixed minor and how to transform the graph and its division afterwards, so that it has maximum degree three. Based on such a division, the original framework of Henzinger etal.can be applied. Afterwards, we show that using this algorithm, one can implement Mehlhorns (1988) 2-approximation algorithm for the Steiner tree problem in linear time on these graph classes.
shortest path minor-closed graph classes steiner tree planar graph mehlhorns algorithm