Improved approximation of maximum vertex coverage problem on bipartite graphs (Q2935262)
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: Improved approximation of maximum vertex coverage problem on bipartite graphs |
scientific article; zbMATH DE number 6382433
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved approximation of maximum vertex coverage problem on bipartite graphs |
scientific article; zbMATH DE number 6382433 |
Statements
Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs (English)
0 references
22 December 2014
0 references
transversal number
0 references
vertex coverage
0 references
LP rounding
0 references
0.8903681635856628
0 references
0.8655905723571777
0 references
0.8625138401985168
0 references
0.8564542531967163
0 references
