Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

<table>The beginning of the construction of  <svg height="11.1" id="M329" style="vertical-align:-0.1881pt" version="1.1" viewbox="0 0 16.975 11.1" width="16.975" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,11.1)">
<g transform="translate(72,-63.12)">
<text transform="matrix(1,0,0,-1,-71.95,63.36)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝒲</tspan>
</text>
</g>
</g>
</svg> graph from <svg height="12.0375" id="M330" style="vertical-align:-0.33858pt" version="1.1" viewbox="0 0 49.724998 12.0375" width="49.724998" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,12.0375)">
<g transform="translate(72,-62.37)">
<text transform="matrix(1,0,0,-1,-71.95,62.76)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝐺</tspan>
</text>
<text transform="matrix(1,0,0,-1,-62.52,67.83)">
<tspan style="font-size: 8.75px; " x="0" y="0">∗</tspan>
</text>
<text transform="matrix(1,0,0,-1,-53.97,62.76)">
<tspan style="font-size: 12.50px; " x="0" y="0">∈</tspan>
<tspan style="font-size: 12.50px; " x="12.027886" y="0">𝒢</tspan>
</text>
</g>
</g>
</svg>.</table>

Advances in Operations Research

fig5

Figure 5

Figure 5: Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks 