An improved approximation for maximum \(k\)-dependent set on bipartite graphs (Q2057593)
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: An improved approximation for maximum k-dependent set on bipartite graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An improved approximation for maximum \(k\)-dependent set on bipartite graphs |
scientific article |
Statements
An improved approximation for maximum \(k\)-dependent set on bipartite graphs (English)
0 references
7 December 2021
0 references
maximum \(k\)-dependent set
0 references
approximation algorithms
0 references
bipartite graphs
0 references
König-Egerváry graphs
0 references
0 references
0 references
0.8034106492996216
0 references
0.8031852841377258
0 references
0.7991496324539185
0 references
0.7897300720214844
0 references
0.7698757648468018
0 references
