Complexity of partial inverse assignment problem and partial inverse cut problem (Q2765604)
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: Complexity of partial inverse assignment problem and partial inverse cut problem |
scientific article; zbMATH DE number 1694890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of partial inverse assignment problem and partial inverse cut problem |
scientific article; zbMATH DE number 1694890 |
Statements
2001
0 references
partial inverse assignment problem
0 references
partial inverse minimum cut problem
0 references
NP-hard
0 references
Complexity of partial inverse assignment problem and partial inverse cut problem (English)
0 references
0.8485434055328369
0 references
0.8158713579177856
0 references
0.8100445866584778
0 references
0.7786879539489746
0 references
0.7578423023223877
0 references
