On the approximability of the minimum rainbow subgraph problem and other related problems (Q1679237)
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: On the approximability of the minimum rainbow subgraph problem and other related problems |
scientific article; zbMATH DE number 6804044
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the approximability of the minimum rainbow subgraph problem and other related problems |
scientific article; zbMATH DE number 6804044 |
Statements
On the approximability of the minimum rainbow subgraph problem and other related problems (English)
0 references
9 November 2017
0 references
approximation algorithm
0 references
densest \(k\)-subgraph problem
0 references
MIN-REP
0 references
0 references
0 references
0 references
0.991060435771942
0 references
0.9082049131393432
0 references
0.8784177899360657
0 references
0.8728594779968262
0 references
0.8634965419769287
0 references
