The max quasi-independent set problem

Authors:
N. Bourgeois;A. Giannakos;G. Lucarelli;I. Milis;V. T. Paschos;O. Pottié
Affiliations:
LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, Paris, France;LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, Paris, France;LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, Paris, France and Department of Informatics, Athens University of Economics and Business, Athens, Greece;Department of Informatics, Athens University of Economics and Business, Athens, Greece;LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, Paris, France;LAMSADE, CNRS FRE 3234 and Université Paris-Dauphine, Paris, France
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 10
Cited 1

Greed is good: approximating independent sets in sparse and bounded-degree graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
k-edge subgraph problems

Discrete Applied Mathematics
Greedily finding a dense subgraph

Journal of Algorithms
A generalization of maximal independent sets

Discrete Applied Mathematics
Massive Quasi-Clique Detection

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Finding a Maximum Density Subgraph

Finding a Maximum Density Subgraph
Graphs and Hypergraphs

Graphs and Hypergraphs
Linear degree extractors and the inapproximability of max clique and chromatic number

Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
Mining market data: a network approach

Computers and Operations Research

Largest sparse subgraphs of random graphs

European Journal of Combinatorics

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-max quasi-independent set, 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 驴-max quasi-independent set and k-max quasi-independent set problems, several results on complexity and approximation are shown, and greedy algorithms are proposed, analyzed and tested.