A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453)
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 series of approximation algorithms for the acyclic directed Steiner tree problem |
scientific article; zbMATH DE number 1002569
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A series of approximation algorithms for the acyclic directed Steiner tree problem |
scientific article; zbMATH DE number 1002569 |
Statements
A series of approximation algorithms for the acyclic directed Steiner tree problem (English)
0 references
28 May 1997
0 references
acyclic directed Steiner tree problem
0 references
0.8592941761016846
0 references
0.8416963219642639
0 references
0.8336115479469299
0 references
