Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108)
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: Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs |
scientific article; zbMATH DE number 6920196
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs |
scientific article; zbMATH DE number 6920196 |
Statements
Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (English)
0 references
17 August 2018
0 references
approximation algorithms
0 references
combinatorial algorithms
0 references
nonlinear program
0 references
graph algorithms
0 references
maximum coverage
0 references
0 references
