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

<table>Valid schedule of length three for graph <svg height="13.775" id="M210" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 15.7875 13.775" width="15.7875" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,13.775)">
<g transform="translate(72,-60.98)">
<text transform="matrix(1,0,0,-1,-71.95,61.03)">
<tspan style="font-size: 12.50px; " x="0" y="0">Z</tspan>
</text>
<text transform="matrix(1,0,0,-1,-64.3,66.03)">
<tspan style="font-size: 8.75px; " x="0" y="0">2</tspan>
</text>
</g>
</g>
</svg>.</table>

Advances in Operations Research

fig4

Figure 4

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