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

Table 1

Previous complexity results on the processors network model.

Topology	Precedence graph	Complexity	Reference
Unbounded chain	Tree	𝒩𝒫-complete	[2]
	Antitree	𝒩𝒫-complete
Star	Tree	𝒩𝒫-complete	[2]
Cycle/chain	Prec	𝜌≥4/3	[4]
Star	Prec	𝜌≥6/5	[3]