A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:53, 30 January 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
