scientific article; zbMATH DE number 2079419
From MaRDI portal
Publication:4471379
zbMath1092.68635MaRDI QIDQ4471379
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
Online Optimization of Busy Time on Parallel Machines ⋮ Real-time scheduling to minimize machine busy times ⋮ LP rounding and combinatorial algorithms for minimizing active and busy time ⋮ Single-Sink Multicommodity Flow with Side Constraints ⋮ Optimizing regenerator cost in traffic grooming ⋮ Optimizing busy time on parallel machines ⋮ Online optimization of busy time on parallel machines ⋮ A model for minimizing active processor time ⋮ Path multicoloring with fewer colors in spiders and caterpillars ⋮ Routing permutations and involutions on optical ring networks: Complexity results and solution to an open problem ⋮ On the complexity of the regenerator cost problem in general networks with traffic grooming ⋮ Minimizing total busy time in parallel scheduling with application to optical networks ⋮ Wavelength assignment in multifiber star networks ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Minimizing maximum fiber requirement in optical networks
This page was built for publication:
