Approximation Algorithms and Hardness of the <i>k</i> -Route Cut Problem (Q4962202): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4302769223 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1112.3611 / rank | |||
Normal rank | |||
Latest revision as of 20:55, 19 April 2024
scientific article; zbMATH DE number 6968331
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation Algorithms and Hardness of the <i>k</i> -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
