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

Approximability and parameterized complexity of multicover by c-intervals.

René van BevernJiehua ChenFalk HüffnerStefan KratschNimrod TalmonGerhard J. Woeginger
Published in: Inf. Process. Lett. (2015)
Keyphrases
  • parameterized complexity
  • global constraints
  • fixed parameter tractable
  • approximation algorithms
  • np hard
  • symmetry breaking
  • knowledge base
  • np complete