Multi-rooted greedy approximation of directed Steiner trees with applications (Q262265)
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 6560727
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multi-rooted greedy approximation of directed Steiner trees with applications |
scientific article; zbMATH DE number 6560727 |
Statements
Multi-rooted greedy approximation of directed Steiner trees with applications (English)
0 references
29 March 2016
0 references
approximation algorithms
0 references
Steiner tree problem
0 references
directed graphs
0 references
greedy algorithm
0 references
tree cover problem
0 references
0.995475172996521
0 references
0.893711507320404
0 references
0.8909549117088318
0 references
0.8575876355171204
0 references
