On the approximability of clique and related maximization problems

  • Authors:

  • Aravind Srinivasan

  • Affiliations:

  • Department of Computer Science and Institute for Advanced Computer Studies, University of Maryland, A.V. Williams Building, College Park, MD

  • Venue:
  • Journal of Computer and System Sciences
  • Year:
  • 2003

Quantified Score

Hi-index 0.02

Visualization

Abstract

We consider approximations of the form n1-o(1) for the Maximum Clique problem, where n is the number of vertices in the input graph and where the "o(1)" term goes to zero as n increases. We show that sufficiently strong negative results for such problems, which we call strong inapproximability results, have interesting consequences for exact computation. A simple sampling method underlies most of our results.