Login / Signup

A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem.

Stefan CanzarKhaled M. ElbassioniJulián Mestre
Published in: ACM J. Exp. Algorithmics (2013)
Keyphrases
  • approximate solutions
  • np hard
  • optimal solution
  • dynamic programming
  • computational complexity
  • computer vision
  • lower bound
  • search space
  • special case
  • polynomial delay