scientific article; zbMATH DE number 5764814

MaRDI QIDQ3579403zbMATH OpenFDO

Authors Jessica Chang, Thomas Erlebach, Renars Gailis, Samir Khuller

Publication date 6 August 2010

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cited in

(7)

• Scheduling to minimize energy and flow time in broadcast scheduling
• Approximating the Interval Constrained Coloring Problem
• Deconstructing Intractability: A Case Study for Interval Constrained Coloring
• Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring
• Batch machine production with perishability time windows and limited batch size
• Approximation algorithms for the interval constrained coloring problem
• A note on on-line broadcast scheduling with deadlines

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 Q3579403)