Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764)
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: Threshold-based preprocessing for approximating the weighted dense k-subgraph problem |
scientific article; zbMATH DE number 6396099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem |
scientific article; zbMATH DE number 6396099 |
Statements
Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (English)
0 references
3 February 2015
0 references
OR in forestry
0 references
dense subgraph
0 references
approximation algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0.7653188109397888
0 references
0.7650278210639954
0 references
0.7611576914787292
0 references
0.7548514604568481
0 references
0.7501797676086426
0 references
