scientific article; zbMATH DE number 6829399

DOI10.4230/LIPIcs.STACS.2016.58zbMath1388.68311MaRDI QIDQ4601910

Harald Räcke, Richard Stotz

Publication date: 24 January 2018

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

schedulingdynamic programminggraph partitioning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (1)

The complexity of tree partitioning

This page was built for publication: