Login / Signup

IV-matching is strongly NP-hard.

Lukas FolwarcznyDusan Knop
Published in: Inf. Process. Lett. (2017)
Keyphrases
  • strongly np hard
  • scheduling problem
  • np hard
  • approximation algorithms
  • branch and bound algorithm
  • graph matching
  • lower bound
  • flowshop
  • setup times
  • optimal solution