• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

On the Parameterized Complexity of Dynamic Problems with Connectivity Constraints.

Faisal N. Abu-KhzamJudith EganMichael R. FellowsFrances A. RosamondPeter Shaw
Published in: COCOA (2014)
Keyphrases
  • parameterized complexity
  • global constraints
  • fixed parameter tractable
  • optimization problems
  • objective function
  • optimal solution
  • np complete