On approximating a scheduling problem

DOI10.1023/A:1011441109660zbMath1066.90027OpenAlexW4236995382MaRDI QIDQ5952318

Pierluigi Crescenzi, Christos H. Papadimitriou, Xiaotie Deng

Publication date: 2001

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011441109660

zbMATH Keywords

communicationbipartite graphparallel computationedge coloring

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

On the max-weight edge coloring problem ⋮ On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. ⋮ Buffer management for colored packets with deadlines ⋮ Scheduling in switching networks with set-up delays ⋮ Approximating the max-edge-coloring problem ⋮ On the Maximum Edge Coloring Problem

This page was built for publication: On approximating a scheduling problem