Login / Signup

Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems.

Andreas BleyJose Neto
Published in: IPCO (2010)
Keyphrases
  • disjoint paths
  • application domains
  • solving problems
  • genetic algorithm
  • computer vision
  • decision trees
  • case study
  • image sequences
  • dynamic programming
  • np complete
  • problems involving