Inapproximability of Combinatorial Optimization Problems

Abstract

We survey results on the hardness of approximating combinatorial optimization problems.

Cited by in corpus (3)

• Joint power and admission control via p norm minimization deflation
• Complexity and Approximability of Parameterized MAX-CSPs
• Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes