Advances in Operations Research

Research Article

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

Figure 1

Difference between the problem 𝑃 | p r e c ; 𝑐 𝑖 𝑗 = 1 ; 𝑝 𝑖 = 1 | 𝐶 m a x and ( 𝑃 , g r i d 2 × 2 ) | p r e c ; 𝑐 𝑖 𝑗 = 𝑑 ( 𝜋 𝑖 , 𝜋 𝑗 ) ; 𝑝 𝑖 = 1 | 𝐶 m a x .
476939.fig.001