Login / Signup

Tractable Parameterizations for the Minimum Linear Arrangement Problem.

Michael R. FellowsDanny HermelinFrances A. RosamondHadas Shachnai
Published in: ACM Trans. Comput. Theory (2016)
Keyphrases
  • computational complexity
  • closed form
  • computationally tractable
  • database
  • np complete
  • databases
  • neural network
  • data mining
  • least squares
  • constraint satisfaction problems
  • version spaces