Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (Q621842)
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: Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem |
scientific article; zbMATH DE number 5842805
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem |
scientific article; zbMATH DE number 5842805 |
Statements
Size-constrained tree partitioning: approximating the multicast \(k\)-tree routing problem (English)
0 references
28 January 2011
0 references
capacitated multicast tree routing
0 references
approximation algorithm
0 references
tree partitioning
0 references
0.98346156
0 references
0.9170213
0 references
0.9149644
0 references
0.8925053
0 references
0.89184284
0 references
0 references
0.8721654
0 references
0.87110615
0 references
0.8707943
0 references
