## On Routing of Multiple Concurrent User Requests in Multi-Radio Multi-Channel Wireless Mesh Networks

- Zhanmao Cao, Chase Qishi Wu, Mark L. Berry
- 2016 17th International Conference on Parallel…
- 2016

1 Excerpt

- Published 2008 in J. ACM

Given a set of demands in a directed graph, the <i>directed congestion minimization</i> problem is to route every demand with the objective of minimizing the heaviest load over all edges. We show that for any constant ϵ > 0, there is no Ω(log<sup>1−ϵ</sup> <i>M</i>)-approximation algorithm on networks of size <i>M</i> unless <i>NP</i> ⊆ <i>ZPTIME</i>(<i>n</i><sup>polylog <i>n</i></sup>). This bound is almost tight given the <i>O</i>(log <i>M</i>/log log <i>M</i>)-approximation via randomized rounding due to Raghavan and Thompson.

@article{Andrews2008AlmosttightHO,
title={Almost-tight hardness of directed congestion minimization},
author={Matthew Andrews and Lisa Zhang},
journal={J. ACM},
year={2008},
volume={55},
pages={27:1-27:20}
}