Login / Signup

Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems.

Ivan BliznetsMarek CyganPawel KomosaMichal PilipczukLukás Mach
Published in: ACM Trans. Algorithms (2020)
Keyphrases
  • lower bound
  • parameterized complexity
  • upper bound
  • exact solution
  • objective function
  • np complete
  • combinatorial optimization
  • branch and bound
  • reasoning tasks
  • min sum