Complexity of the min-max (regret) versions of min cut problems (Q924631): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.disopt.2007.11.008 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DISOPT.2007.11.008 / rank | |||
Normal rank | |||
Latest revision as of 08:16, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity of the min-max (regret) versions of min cut problems |
scientific article |
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
