Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7 (Q4579900)
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 6916153
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Combinatorial approximation of maximum \(k\)-vertex cover in bipartite graphs within ratio 0,7 |
scientific article; zbMATH DE number 6916153 |
Statements
Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (English)
0 references
10 August 2018
0 references
approximation algorithm
0 references
bipartite graph
0 references
max \(k\)-vertex cover
0 references
0 references
0.962388277053833
0 references
0.95235937833786
0 references
0.8402532935142517
0 references
0.8120163679122925
0 references
0.8047198057174683
0 references
