Erratum to “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks”

Table 1

Topology	Precedence graph	Complexity	Reference
Unbounded chain	tree	𝒩𝒫-complete	[5]
	anti-tree	𝒩𝒫-complete
Star	tree	𝒩𝒫-complete	[5]
Cycle/chain	prec/bipartiteofdepthtwo	𝜌≥4/3	[3]
Star	prec	𝜌≥6/5	[6]