A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs (Q6325556)
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: A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs |
scientific article; zbMATH DE number 900386138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time approximation schema for maximum k-vertex cover in bipartite graphs |
scientific article; zbMATH DE number 900386138 |
Statements
18 September 2019
0 references
cs.CC
0 references
math.CO
0 references
