Login / Signup

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

Jesper NederlofCéline M. F. Swennenhuis
Published in: IPEC (2020)
Keyphrases
  • fine grained
  • parameterized complexity
  • coarse grained
  • scheduling problem
  • fixed parameter tractable
  • access control
  • global constraints
  • data lineage
  • symmetry breaking
  • machine learning
  • np hard
  • conjunctive queries