Pages that link to "Item:Q538278"
From MaRDI portal
The following pages link to Scheduling \(UET\)-tasks on a star network: complexity and approximation (Q538278):
Displaying 3 items.
- Erratum to ``Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks'' (Q447565) (← links)
- Inapproximability and polynomial-time approximation algorithm for UET tasks on structured processor networks (Q666411) (← links)
- Scheduling in the presence of processor networks : complexity and approximation (Q2893338) (← links)
