Pages that link to "Item:Q3148374"
From MaRDI portal
The following pages link to On the hardness of approximating the UET-UCT scheduling problem with hierarchical communications (Q3148374):
Displayed 3 items.
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications. (Q1401200) (← links)
- An approximation algorithm for the precedence constrained scheduling problem with hierarchical communications (Q1853631) (← links)
- General scheduling non-approximability results in presence of hierarchical communications (Q2384613) (← links)