Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (Q3637083)
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 5576192
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem |
scientific article; zbMATH DE number 5576192 |
Statements
Size-Constrained Tree Partitioning: A Story on Approximation Algorithm Design for the Multicast k-Tree Routing Problem (English)
0 references
7 July 2009
0 references
capacitated multicast tree routing
0 references
approximation algorithm
0 references
tree partitioning
0 references
0.98346156
0 references
0.90706265
0 references
0.90317297
0 references
0.88285816
0 references
0.8819299
0 references
0.8665886
0 references
0.86432755
0 references
0.86325234
0 references
