A deterministic approximation algorithm for the densest \(k\)-subgraph problem
From MaRDI portal
Publication:2427738
DOI10.1504/IJOR.2008.017534zbMath1138.05322OpenAlexW1989483229MaRDI QIDQ2427738
Alain Billionnet, Frédéric Roupin
Publication date: 27 May 2008
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2008.017534
Extremal problems in graph theory (05C35) Quadratic programming (90C20) Linear programming (90C05) Structural characterization of families of graphs (05C75)
Related Items (10)
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ The densest \(k\)-subgraph problem on clique graphs ⋮ A dynamic edge covering and scheduling problem: complexity results and approximation algorithms ⋮ A ``maximum node clustering problem ⋮ A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs ⋮ A polyhedral study of the maximum edge subgraph problem ⋮ A polyhedral study of the maximum edge subgraph problem ⋮ Variable neighborhood search for the heaviest \(k\)-subgraph ⋮ Combinatorial properties and further facets of maximum edge subgraph polytopes
This page was built for publication: A deterministic approximation algorithm for the densest \(k\)-subgraph problem
