Pages that link to "Item:Q5431337"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431337):
Displaying 6 items.
- Complexity and approximability of \(k\)-splittable flows (Q861276) (← links)
- Maximum \(k\)-splittable \(s, t\)-flows (Q927403) (← links)
- Proportional scheduling, split-proofness, and merge-proofness (Q932808) (← links)
- Scheduling split intervals with non-uniform demands (Q2218651) (← links)
- Décomposition d'une application sur une architecture bus : propriétés des ordonnancements optimaux (Q4345416) (← links)
- Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids (Q4581762) (← links)