scientific article
From MaRDI portal
Publication:3579403
zbMath1192.68028MaRDI QIDQ3579403
Erlebach, Thomas, Samir Khuller, Jessica Chang, Renars Gailis
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Network design and communication in computer systems (68M10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
Approximating the Interval Constrained Coloring Problem ⋮ Batch machine production with perishability time windows and limited batch size ⋮ Approximation algorithms for the interval constrained coloring problem ⋮ Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring ⋮ A note on on-line broadcast scheduling with deadlines ⋮ Scheduling to minimize energy and flow time in broadcast scheduling ⋮ Deconstructing Intractability: A Case Study for Interval Constrained Coloring
This page was built for publication:
