Approximating optimum branchings in linear time (Q976065)
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: Approximating optimum branchings in linear time |
scientific article; zbMATH DE number 5721966
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximating optimum branchings in linear time |
scientific article; zbMATH DE number 5721966 |
Statements
Approximating optimum branchings in linear time (English)
0 references
16 June 2010
0 references
approximation algorithm
0 references
graph algorithm
0 references
branching
0 references
0 references
0.8520290851593018
0 references
0.7758823037147522
0 references
0.7689797878265381
0 references
0.7666910290718079
0 references
0.7618703246116638
0 references
