A note on approximating the min-max vertex disjoint paths on directed acyclic graphs (Q657914)
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: A note on approximating the min-max vertex disjoint paths on directed acyclic graphs |
scientific article; zbMATH DE number 5996366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A note on approximating the min-max vertex disjoint paths on directed acyclic graphs |
scientific article; zbMATH DE number 5996366 |
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
0.802040696144104
0 references
0.7962126731872559
0 references
0.7921303510665894
0 references
0.76426100730896
0 references
0.7627755403518677
0 references
