Improved approximation algorithm for minimum weight \(k\)-subgraph cover problem (Q2180167)
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 7200309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation algorithm for minimum weight \(k\)-subgraph cover problem |
scientific article; zbMATH DE number 7200309 |
Statements
Improved approximation algorithm for minimum weight \(k\)-subgraph cover problem (English)
0 references
13 May 2020
0 references
connected \(k\)-subgraph cover
0 references
approximation algorithm
0 references
girth
0 references
0.9400094747543336
0 references
0.9266979694366456
0 references
0.8184944987297058
0 references
0.8150615692138672
0 references
0.8102498650550842
0 references
