Threshold-based preprocessing for approximating the weighted dense k-subgraph problem

Based on an application in forestry, we study the dense k-subgraph problem: Given a parameter k∈N and an undirected weighted graph G, the task is to find a subgraph of G with k vertices such that the sum of the weights of the induced edges is maximized. The problem is well-known to be NP-hard and difficult to approximate if the underlying graph does not satisfy the triangle inequality.

[1]  Peter Gritzmann,et al.  A quadratic optimization model for the consolidation of farmland by means of lend-lease agreements , 2004 .

[2]  Refael Hassin,et al.  Approximation algorithms for maximum dispersion , 1997, Oper. Res. Lett..

[3]  David Pisinger,et al.  Upper bounds and exact algorithms for p-dispersion problems , 2006, Comput. Oper. Res..

[4]  Alain Billionnet,et al.  Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method , 2009, Discret. Appl. Math..

[5]  U. Feige,et al.  On the densest k-subgraph problems , 1997 .

[6]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Aditya Bhaskara,et al.  Detecting high log-densities: an O(n¼) approximation for densest k-subgraph , 2010, STOC '10.

[8]  Andrew V. Goldberg,et al.  Finding a Maximum Density Subgraph , 1984 .

[9]  Michael Langberg,et al.  Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.

[10]  Michael M. Sørensen,et al.  New facets and a branch-and-cut algorithm for the weighted clique problem , 2004, Eur. J. Oper. Res..

[11]  Cid C. de Souza,et al.  The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations , 2000, Eur. J. Oper. Res..

[12]  Ulrich Faigle,et al.  A Lagrangian relaxation approach to the edge-weighted clique problem , 2001, Eur. J. Oper. Res..

[13]  Peter Gritzmann,et al.  Constrained Minimum-k-Star Clustering and its application to the consolidation of farmland , 2011, Oper. Res..

[14]  Kumar Chellapilla,et al.  Finding Dense Subgraphs with Size Bounds , 2009, WAW.

[15]  Yehoshua Perl,et al.  Clustering and domination in perfect graphs , 1984, Discret. Appl. Math..

[16]  Guy Kortsarz,et al.  On choosing a dense subgraph , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[17]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.

[18]  Jiawei Zhang,et al.  An improved rounding method and semidefinite programming relaxation for graph partition , 2002, Math. Program..

[19]  Ioannis Milis,et al.  A constant approximation algorithm for the densest k , 2008, Inf. Process. Lett..

[20]  Hisao Tamaki,et al.  Greedily Finding a Dense Subgraph , 2000, J. Algorithms.