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

<table>An example of a prism of size <svg height="10.7375" id="M125" style="vertical-align:-0.13794pt" version="1.1" viewbox="0 0 8.6000004 10.7375" width="8.6000004" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.7375)">
<g transform="translate(72,-63.41)">
<text transform="matrix(1,0,0,-1,-71.95,63.6)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝑘</tspan>
</text>
</g>
</g>
</svg> and length <svg height="10.325" id="M126" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 11.1875 10.325" width="11.1875" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,10.325)">
<g transform="translate(72,-63.74)">
<text transform="matrix(1,0,0,-1,-71.95,63.79)">
<tspan style="font-size: 12.50px; " x="0" y="0">𝐿</tspan>
</text>
</g>
</g>
</svg>.</table>

Advances in Operations Research

fig2

Figure 2

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