Exact and superpolynomial approximation algorithms for the densest $k$-subgraph problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles European Journal of Operational Research Year : 2017

Exact and superpolynomial approximation algorithms for the densest $k$-subgraph problem


The densest $k$-subgraph problem is a generalization of the maximum clique problem, in which we are given a graph and a positive integer k, and we search among all the subsets of k vertices of the input graph for the subset which induces the maximum number of edges. densest $k$-subgraph is a well known optimization problem with various applications as, for example, in the design of public encryption schemes, the evaluation of certain financial derivatives, the identification of communities with similar characteristics, etc. In this paper, we first present algorithms for finding exact solutions for densest $k$-subgraph which improve upon the standard exponential time complexity of an exhaustive enumeration by creating a link between the computation of an optimum for this problem to the computation of other graph-parameters such as dominating set, vertex cover, longest path, etc. An FPT algorithm is also proposed which considers as a parameter the size of the minimum vertex cover. Finally, we present several approximation algorithms which run in moderately exponential or parameterized time, describing trade-offs between complexity and approximability. In contrast with most of the algorithms in the bibliography, our algorithms need only polynomial space.
Fichier principal
Vignette du fichier
k-densest.pdf (412.03 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01539561 , version 1 (15-06-2017)



Nicolas Bourgeois, Aristotelis Giannakos, Giorgio Lucarelli, Ioannis Milis, Vangelis Th Paschos. Exact and superpolynomial approximation algorithms for the densest $k$-subgraph problem. European Journal of Operational Research, 2017, 262, pp.894 - 903. ⟨10.1016/j.ejor.2017.04.034⟩. ⟨hal-01539561⟩
269 View
646 Download



Gmail Facebook Twitter LinkedIn More