Complexity of the min-max (regret) versions of min cut problems (Q924631)
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 the min-max (regret) versions of min cut problems |
scientific article; zbMATH DE number 5276152
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the min-max (regret) versions of min cut problems |
scientific article; zbMATH DE number 5276152 |
Statements
Complexity of the min-max (regret) versions of min cut problems (English)
0 references
16 May 2008
0 references
min-max
0 references
min-max regret
0 references
complexity
0 references
min cut
0 references
\(\min s-t\) cut
0 references
0 references
0 references
0 references
