Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems

Details Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems

2011-09-22

arxiv.org/abs/1109.4910v1

Computer Science

Computational Complexity

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-263951