Submodular containment is hard, even for networks (Q2564307)
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: Submodular containment is hard, even for networks |
scientific article; zbMATH DE number 961915
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Submodular containment is hard, even for networks |
scientific article; zbMATH DE number 961915 |
Statements
Submodular containment is hard, even for networks (English)
0 references
14 July 1997
0 references
submodularity
0 references
complexity
0 references
networks
0 references
submodular base polyhedra
0 references
strongly co-NP-complete
0 references
dynamic games
0 references
0 references
0 references
0.8499887
0 references
0.8365439
0 references
0.83308476
0 references
0.8245747
0 references
0 references
0 references
