A deterministic approximation algorithm for the densest \(k\)-subgraph problem
From MaRDI portal
Publication:2427738
DOI10.1504/IJOR.2008.017534zbMath1138.05322MaRDI QIDQ2427738
Alain Billionnet, Frédéric Roupin
Publication date: 27 May 2008
Published in: International Journal of Operational Research (Search for Journal in Brave)
05C35: Extremal problems in graph theory
90C20: Quadratic programming
90C05: Linear programming
05C75: Structural characterization of families of graphs
Related Items
A polyhedral study of the maximum edge subgraph problem, A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs, Variable neighborhood search for the heaviest \(k\)-subgraph, The densest \(k\)-subgraph problem on clique graphs, A ``maximum node clustering problem