Login / Signup

On the Fine-grained Parameterized Complexity of Partial Scheduling to Minimize the Makespan.

Jesper NederlofCéline M. F. Swennenhuis
Published in: Algorithmica (2022)
Keyphrases
  • fine grained
  • parameterized complexity
  • coarse grained
  • global constraints
  • scheduling problem
  • access control
  • fixed parameter tractable
  • databases
  • computational problems
  • symmetry breaking
  • data lineage