scientific article; zbMATH DE number 1333600

zbMath0925.90222MaRDI QIDQ4260373

Hans L. Bodlaender, Klaus Jansen

Publication date: 19 September 1999

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

Mathematics Subject Classification ID

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

Related Items (23)

Fair Packing of Independent Sets ⋮ Scheduling with conflicts: Online and offline algorithms ⋮ The maximum flow problem with disjunctive constraints ⋮ Fair allocation algorithms for indivisible items under structured conflict constraints ⋮ The mutual exclusion scheduling problem for permutation and comparability graphs. ⋮ Scheduling with machine conflicts ⋮ Scheduling on uniform machines with a conflict graph: complexity and resolution ⋮ Fair allocation of indivisible items with conflict graphs ⋮ Paths, trees and matchings under disjunctive constraints ⋮ Probabilistic analysis for scheduling with conflicts ⋮ Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem ⋮ Partitioning a weighted partial order ⋮ Approximability of the subset sum reconfiguration problem ⋮ Approximation algorithms for time constrained scheduling ⋮ Approximability of the Subset Sum Reconfiguration Problem ⋮ Heuristics and lower bounds for the bin packing problem with conflicts ⋮ Scheduling identical jobs on uniform machines with a conflict graph ⋮ Solution approaches for storage loading problems with stacking constraints ⋮ An approximation scheme for bin packing with conflicts ⋮ A unifying model for locally constrained spanning tree problems ⋮ Structural parameterizations of budgeted graph coloring ⋮ Structural parameterizations of budgeted graph coloring ⋮ Treelike comparability graphs

This page was built for publication: