Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331)
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: Minimizing maximum weight of subsets of a maximum matching in a bipartite graph |
scientific article; zbMATH DE number 6487380
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing maximum weight of subsets of a maximum matching in a bipartite graph |
scientific article; zbMATH DE number 6487380 |
Statements
Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (English)
0 references
30 September 2015
0 references
bipartite graph
0 references
maximal matching
0 references
NP-hardness in the strong sense
0 references
non-approximability
0 references
approximation algorithm
0 references
