Approximation algorithms and hardness of the \(k\)-route cut problem (Q5743436)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7053315
| 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 7053315 |
Statements
10 May 2019
0 references
0 references
0 references
0 references
0.9979032278060912
0 references
0.8884086608886719
0 references
0.8481088876724243
0 references
0.8113366365432739
0 references
0.8110926151275635
0 references
