Hard graphs for the randomized Boppana-Halldórsson algorithm for MAXCLIQUE

Authors:
Marcus Peinado
Affiliations:
Department of Computer Science, Boston University, Boston, MA
Venue:
Nordic Journal of Computing
Year:
1994

Citing 4
Cited 2

A guided tour of Chernoff bounds

Information Processing Letters
The greedy coloring is a bad probabilistic algorithm

Journal of Algorithms
Approximating maximum independent sets by excluding subgraphs

BIT
Improved non-approximability results

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Hiding cliques for cryptographic security

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Hiding Cliques for Cryptographic Security

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

A randomized version of the MAXCLIQUE approximation algorithm by Boppana and Halldórsson is analyzed. The Boppana Halldórsson algorithm has the best performance guarantee currently known for the MAXCLIQUE problem. This paper presents a class of graphs on which the performance ratio of the randomized version of the algorithm is not better than Ω(√n) with probability greater than 1 - 1/nω(1).