Summary: Relations between
Average Case Complexity and Approximation Complexity
Extended Abstract
Uriel Feige
Faculty of Mathematics and Computer Science
Weizmann Institute, Rehovot 76100, Israel
feige@wisdom.weizmann.ac.il
ABSTRACT
We investigate relations between average case complexity
and the complexity of approximation. Our preliminary find­
ings indicate that this is a research direction that leads to
interesting insights. Under the assumption that refuting
3SAT is hard on average on a natural distribution, we derive
hardness of approximation results for min bisection, dense
k­subgraph, max bipartite clique and the 2­catalog segmen­
tation problem. No NP­hardness of approximation results
are currently known for these problems.
1. INTRODUCTION
One way of coping with NP­hard combinatorial optimiza­
tion problems is by relaxing the requirement for optimality

Source: Applebaum, Benny - Faculty of Mathematics and Computer Science, Weizmann Institute of Science

Collections: Computer Technologies and Information Sciences