Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
APPROX-RANDOM(2012)
摘要
We study the approximability of a number of graph problems: treewidth and pathwidth of graphs, one-shot black (and black-white) pebbling costs of directed acyclic graphs, and a variety of different graph layout problems such as minimum cut linear arrangement and interval graph completion. We show that, assuming the recently introduced Small Set Expansion Conjecture, all of these problems are hard to approximate within any constant factor.
更多查看译文
关键词
directed acyclic graph,minimum cut,computational complexity,computer science,interval graph,data structure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要