Approximation algorithms for telephone k-multicast achieving Õ(t^{1/3}) multiplicative in undirected graphs and Õ(k^{1/2}) additive in directed graphs, via minimum-poise k-tree reductions and greedy network decomposition.
Hedetniemi, Stephen T
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Telephone $k$-Multicast Problem
Approximation algorithms for telephone k-multicast achieving Õ(t^{1/3}) multiplicative in undirected graphs and Õ(k^{1/2}) additive in directed graphs, via minimum-poise k-tree reductions and greedy network decomposition.