A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:53, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on approximating the min-max vertex disjoint paths on directed acyclic graphs |
scientific article |
Statements
A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (English)
0 references
11 January 2012
0 references
approximation algorithm
0 references
vertex disjoint path
0 references
rounding
0 references
FPTAS
0 references
directed acyclic graph
0 references
