Pages that link to "Item:Q666411"
From MaRDI portal
The following pages link to Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411):
Displaying 3 items.
- Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565) (← links)
- Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278) (← links)
- On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374) (← links)