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

Glencora Borradaile Erik D. Demaine Siamak Tazari

Published in: CoRR (2009)

Keyphrases

approximation schemes
approximation algorithms
np complete
special case
numerical methods
bounded treewidth
multiscale
computational complexity
object recognition
higher order
directed graph
np hardness
polynomial time complexity