Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs

Marcin Pilipczuk, Michal Pilipczuk, Piotr Sankowski, Erik Jan van Leeuwen. Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs. ACM Transactions on Algorithms, 14(4), 2018. [doi]

@article{PilipczukPSL18,
  title = {Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs},
  author = {Marcin Pilipczuk and Michal Pilipczuk and Piotr Sankowski and Erik Jan van Leeuwen},
  year = {2018},
  doi = {10.1145/3239560},
  url = {https://doi.org/10.1145/3239560},
  researchr = {https://researchr.org/publication/PilipczukPSL18},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {14},
  number = {4},
}