Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (Q1041216)
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: Covering the edges of bipartite graphs using \(K_{2,2}\) graphs |
scientific article; zbMATH DE number 5641347
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Covering the edges of bipartite graphs using \(K_{2,2}\) graphs |
scientific article; zbMATH DE number 5641347 |
Statements
Covering the edges of bipartite graphs using \(K_{2,2}\) graphs (English)
0 references
1 December 2009
0 references
approximation algorithms
0 references
network design
0 references
set cover
0 references
0 references
0 references
