The max quasi-independent set problem

  • Authors:
  • N. Bourgeois;A. Giannakos;G. Lucarelli;I. Milis;V. Th. Paschos;O. Pottié

  • Affiliations:
  • LAMSADE, CNRS and Université Paris-Dauphine, France;LAMSADE, CNRS and Université Paris-Dauphine, France;LAMSADE, CNRS and Université Paris-Dauphine, France;Department of Informatics, Athens University of Economics and Business, Greece;LAMSADE, CNRS and Université Paris-Dauphine, France;LAMSADE, CNRS and Université Paris-Dauphine, France

  • Venue:
  • CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we deal with the problem of finding quasi-independent sets in graphs. This problem is formally defined in three versions, which are shown to be polynomially equivalent. The one that looks most general, namely, f-QIS, consists of, given a graph and a non-decreasing function f, finding a maximum size subset Q of the vertices of the graph, such that the number of edges in the induced subgraph is less than or equal to f(|Q|). For this problem, we show an exact solution method that runs within time $O^*(2^{\frac{d-27/23}{d+1}n})$ on graphs of average degree bounded by d. For the most specifically defined γ-QIS and k-QIS problems, several results on complexity and approximation are shown, and greedy algorithms are proposed, analyzed and tested.