arXiv (Cornell University) · 2011 · 11 citations · 17 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsDiscrete MathematicsApproximation AlgorithmsCombinatorial OptimizationDirected Acyclic GraphsGraph AlgorithmsGraph Layout AlgorithmsGraph TheoryComputational Complexity Of Graph AlgorithmsDirected GraphsGraph CompletionMinimum CutSpace Complexity Of Graph Problems
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.
17
On the power of unique 2-prover 1-round games
Subhash Khot · 2002 · 854 citations
Call routing and the ratcatcher
Paul Seymour, Robin Thomas · COMBINATORICA · 1994 · 395 citations
Lefteris M. Kirousis, Christos H. Papadimitriou · Theoretical Computer Science · 1986 · 294 citations · Full text