scientific article; zbMATH DE number 1241387

zbMATH Open0912.68009MaRDI QIDQ4224927

Klaus Jansen

Publication date: 18 May 1999

Title of this publication is not available (Why is that?)

zbMATH Keywords

schedulinginterconnection networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Combinatorial aspects of packing and covering (05B40)

Related Items (4)

A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds ⋮ A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ Title not available (Why is that?)

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