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

Parameterized complexity dichotomy for Steiner Multicut.

Karl BringmannDanny HermelinMatthias MnichErik Jan van Leeuwen
Published in: J. Comput. Syst. Sci. (2016)
Keyphrases
  • parameterized complexity
  • global constraints
  • fixed parameter tractable
  • symmetry breaking
  • lower bound
  • np hard
  • np complete
  • bounded treewidth