Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks

<table class="table-group" width="800px"><tr class="fig-image" id="a"><td><img alt="982713.fig.006a" src="https://static.hindawi.com/articles/jam/volume-2013/982713/figures/982713.fig.006a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>Average scheduling length          </td></tr></table></td></tr><tr class="fig-image" id="b"><td><img alt="982713.fig.006b" src="https://static.hindawi.com/articles/jam/volume-2013/982713/figures/982713.fig.006b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>Average running time</td></tr></table></td></tr></table>

<table>Impact of degree of freedom.</table>

Journal of Applied Mathematics

fig6

Figure 6

Figure 6: Hypergraph Modeling and Approximation Algorithms for the Minimum Length Link Scheduling in Multiuser MIMO Networks 