Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68329OpenAlexW2495578842MaRDI QIDQ5431337

Piotr Krysta, Peter Sanders, Berthold Vöcking

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Complexity and approximability of \(k\)-splittable flows, Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids, Maximum \(k\)-splittable \(s, t\)-flows