Complexity of the min-max (regret) versions of min cut problems (Q924631): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.disopt.2007.11.008 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2068827145 / rank | |||
Normal rank | |||
Revision as of 20:57, 19 March 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
