Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph (Q2875146)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6330059
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph |
scientific article; zbMATH DE number 6330059 |
Statements
13 August 2014
0 references
approximation algorithm
0 references
densest \(k\) subgraph
0 references
LP hierarchies
0 references
random planted model
0 references
Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph (English)
0 references
0.847766101360321
0 references
0.8413974642753601
0 references
0.8303554058074951
0 references
0.8140572905540466
0 references
0.8050608038902283
0 references
