New algorithms for maximum disjoint paths based on tree-likeness (Q4606313)
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 6846413
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithms for maximum disjoint paths based on tree-likeness |
scientific article; zbMATH DE number 6846413 |
Statements
2 March 2018
0 references
disjoint paths
0 references
approximation algorithms
0 references
feedback vertex set
0 references
New Algorithms for Maximum Disjoint Paths Based on Tree-Likeness (English)
0 references
0.9978057742118835
0 references
0.8449754118919373
0 references
0.8421030640602112
0 references
0.8405879139900208
0 references
0.8349413275718689
0 references
