A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance (Q6561572)
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: A weighted inverse minimum s-t cut problem with value constraint under the Bottleneck-type Hamming distance |
scientific article; zbMATH DE number 7870971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance |
scientific article; zbMATH DE number 7870971 |
Statements
A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance (English)
0 references
25 June 2024
0 references
inverse problem
0 references
Bottleneck-type Hamming distance
0 references
binary search
0 references
strongly polynomial time algorithm
0 references
0.8807440996170044
0 references
0.8609997034072876
0 references
0.8427155017852783
0 references
0.836896538734436
0 references
0.8319036364555359
0 references
