In: 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014 Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms Association for Computing Machinery, New York, pp. 1782-1801.
Tight bounds for planar strongly connected steiner subgraph with fixed number of terminals (and extensions)