scientific article; zbMATH DE number 2079419
From MaRDI portal
Publication:4471379
Recommendations
- Routing and wavelength assignment by partition colouring
- scientific article; zbMATH DE number 5990404
- Constrained bipartite edge coloring with applications to wavelength routing
- STACS 2004
- scientific article; zbMATH DE number 17824
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Intervalizing \(k\)-colored graphs
- About equivalent interval colorings of weighted graphs
- Bounds on spectrum graph coloring
- A generalization of interval edge-colorings of graphs
Cited in
(25)- LP rounding and combinatorial algorithms for minimizing active and busy time
- On superperfection of edge intersection graphs of paths
- 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
- Minimizing maximum fiber requirement in optical networks
- Online optimization of busy time on parallel machines. (Extended abstract)
- Single-Sink Multicommodity Flow with Side Constraints
- Wavelength assignment in multifiber star networks
- scientific article; zbMATH DE number 5990404 (Why is no real title available?)
- Optimizing busy time on parallel machines
- Online optimization of busy time on parallel machines
- On the complexity of the regenerator cost problem in general networks with traffic grooming
- Automata, Languages and Programming
- Line system design and a generalized coloring problem
- Complexity and online algorithms for minimum skyline coloring of intervals
- Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations
- Optimizing regenerator cost in traffic grooming
- Multithread interval scheduling with flexible machine availabilities: complexity and efficient algorithms
- On non-superperfection of edge intersection graphs of paths
- Maximizing the number of requests in oriented trees with a grooming factor
- Approximation algorithms for round-UFP and round-SAP
- Minimizing total busy time in parallel scheduling with application to optical networks
- Online flexible busy time scheduling on heterogeneous machines
- Integer linear programming formulations and heuristic solution approaches for busy time minimization in temporal bin packing
- Real-time scheduling to minimize machine busy times
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471379)
