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

<table>Partition of <svg height="11.8" id="M332" style="vertical-align:-0.15048pt" version="1.1" viewbox="0 0 18.25 11.8" width="18.25" xmlns="http://www.w3.org/2000/svg">
<g transform="matrix(1.25,0,0,-1.25,0,11.8)">
<g transform="translate(72,-62.56)">
<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>
</g>
</g>
</svg> graph into tasks sets <svg height="11.1" id="M333" style="vertical-align:-0.1881pt" version="1.1" viewbox="0 0 14.6875 11.1" width="14.6875" 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>, <svg height="11.1" id="M334" style="vertical-align:-0.1881pt" version="1.1" viewbox="0 0 15.9 11.1" width="15.9" 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>, and <svg height="11.1" id="M335" style="vertical-align:-0.1881pt" version="1.1" viewbox="0 0 14.6875 11.1" width="14.6875" 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>.</table>

Advances in Operations Research

fig7

Figure 7

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