Approximation algorithms and hardness of the \(k\)-route cut problem (Q4962202)
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: Approximation algorithms and hardness of the k-route cut problem |
scientific article; zbMATH DE number 6968331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation algorithms and hardness of the \(k\)-route cut problem |
scientific article; zbMATH DE number 6968331 |
Statements
Approximation Algorithms and Hardness of the <i>k</i> -Route Cut Problem (English)
0 references
30 October 2018
0 references
\(k\)-route cut problem
0 references
approximation algorithm
0 references
0.9979032278060912
0 references
0.8881560564041138
0 references
0.8559877276420593
0 references
0.8167631030082703
0 references
0.815896213054657
0 references
