Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem |
scientific article |
Statements
Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (English)
0 references
6 December 2017
0 references
combinatorial optimization
0 references
dense subgraphs
0 references
exact and parameterized algorithms
0 references
superpolynomial approximation algorithms
0 references
0 references
0 references
0 references
0 references
