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

<table>Next step of the construction of <svg height="11.1" id="M331" 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. Path of length three is created and precedence constraints between tasks are added.</table>

Advances in Operations Research

fig6

Figure 6

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