A note on the approximability of the dense subgraph problem.
From MaRDI portal
Recommendations
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem
- Exact and approximation algorithms for densest \(k\)-subgraph (extended abstract)
- The dense \(k\)-subgraph problem
- On Finding Dense Subgraphs
- On solving the densest \(k\)-subgraph problem on large graphs
- Finding dense subgraphs with semidefinite programming (extended abstract)
- The densest subgraph problem in sparse random graphs
- Complexity of finding dense subgraphs
- Proportionally dense subgraph of maximum size: complexity and approximation
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
Cited in
(8)- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- A deterministic approximation algorithm for the densest \(k\)-subgraph problem
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Dense subgraph problems with output-density conditions
- Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
- Discounted average degree density metric and new algorithms for the densest subgraph problem
- The dense \(k\)-subgraph problem
- Approximation of dense-\(\frac n2\)-subgraph and table compression problems
This page was built for publication: A note on the approximability of the dense subgraph problem.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1776068)