Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs

Glencora Borradaile, Erik D. Demaine, Siamak Tazari. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs. Algorithmica, 68(2):287-311, 2014. [doi]

@article{BorradaileDT14,
  title = {Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs},
  author = {Glencora Borradaile and Erik D. Demaine and Siamak Tazari},
  year = {2014},
  doi = {10.1007/s00453-012-9662-2},
  url = {http://dx.doi.org/10.1007/s00453-012-9662-2},
  researchr = {https://researchr.org/publication/BorradaileDT14},
  cites = {0},
  citedby = {0},
  journal = {Algorithmica},
  volume = {68},
  number = {2},
  pages = {287-311},
}