The following pages link to Computing and Combinatorics (Q4681194):
Displaying 9 items.
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- Single and multiple device DSA problems, complexities and online algorithms (Q764370) (← links)
- A polynomial time approximation algorithm for dynamic storage allocation (Q1176726) (← links)
- Three approximation algorithms for solving the generalized segregated storage problem. (Q1426687) (← links)
- Scheduling under the network of temporo-spatial proximity relationships (Q1652320) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Approximation bounds for the minimum \(k\)-storage problem (Q1796432) (← links)
- (Q3128936) (← links)
- (Q5558270) (← links)