The following pages link to (Q4471379):
Displaying 21 items.
- Optimizing busy time on parallel machines (Q476900) (← links)
- Online optimization of busy time on parallel machines (Q477193) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Optimizing regenerator cost in traffic grooming (Q655419) (← links)
- Minimizing total busy time in parallel scheduling with application to optical networks (Q708204) (← links)
- Real-time scheduling to minimize machine busy times (Q906551) (← links)
- LP rounding and combinatorial algorithms for minimizing active and busy time (Q1702663) (← links)
- On superperfection of edge intersection graphs of paths (Q2056890) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem (Q2466024) (← links)
- Minimizing maximum fiber requirement in optical networks (Q2581759) (← links)
- Online Optimization of Busy Time on Parallel Machines (Q2898056) (← links)
- Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
- Wavelength assignment in multifiber star networks (Q3057165) (← links)
- (Q3105838) (← links)
- Automata, Languages and Programming (Q5466456) (← links)
- Algorithms - ESA 2003 (Q5897231) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations (Q6496366) (← links)
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms (Q6611071) (← links)
