Login / Signup

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

Glencora BorradaileErik D. DemaineSiamak Tazari
Published in: Algorithmica (2014)
Keyphrases
  • approximation schemes
  • approximation algorithms
  • np complete
  • bounded treewidth
  • computer vision
  • polynomial time complexity
  • graph theoretic
  • np hardness
  • truth table