Max Clique
Interactive proofs and the hardness of approximating cliques https://dl.acm.org/doi/pdf/10.1145/226643.226652 The contribution of this paper is two-fold. First, a connection is established between approximating the size of the largest clique in a graph and multi-prover interactive proofs. Second, an efficient multi-prover interactive proof for NP languages is constructed, where the verifier uses very few random bits and communication bits. Last, the connection between cliques and efficient multi-prover interaction proofs, is shown to yield hardness results on the complexity of approximating the size of the largest clique in a graph. Why is maximum clique often easy in practice? http://www.optimization-online.org/DB_FILE/2018/07/6710.pdf To this day, the maximum clique problem remains a computationally challenging problem. Indeed, despite researchers’ best efforts, there exist unsolved benchmark instances with one thousand vertices. However, relatively simple algorithms solve real-life ...