Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (Q1702134)
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: Simpler and better approximation algorithms for the unweighted minimum label s-t cut problem |
scientific article; zbMATH DE number 6844608
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem |
scientific article; zbMATH DE number 6844608 |
Statements
Simpler and better approximation algorithms for the unweighted minimum label \(s\)-\(t\) cut problem (English)
0 references
28 February 2018
0 references
label cut
0 references
minimum cut
0 references
shortest path
0 references
approximation algorithms
0 references
0.9260131
0 references
0.9106737
0 references
0.9106737
0 references
0.89397335
0 references
0.89397335
0 references
0.88234085
0 references
0.8810453
0 references
0.8769539
0 references
0.8764421
0 references
