Inapproximability of Treewidth and Related Problems.

Yu Wu Per Austrin Toniann Pitassi David Liu

Published in: J. Artif. Intell. Res. (2014)

Keyphrases

related problems
approximation algorithms
search space
upper bound
bounded treewidth
space complexity
boolean functions
tree decompositions
range searching
stable marriage
discrete random variables
np hard
broadly applicable
graph structure
high dimensional
worst case
structured databases