Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem |
scientific article; zbMATH DE number 6816189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem |
scientific article; zbMATH DE number 6816189 |
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
0 references
0.94707346
0 references
0 references
0 references
0 references
0.9205382
0 references
0.92053807
0 references
0.9166373
0 references
0.91241604
0 references
