近似算法Approximation-PartI.pdfVIP

  • 36
  • 0
  • 约1.65万字
  • 约 20页
  • 2018-10-13 发布于江苏
  • 举报
Approximation Algorithms Q. Suppose I need to solve an NP-hard problem. What should I do? A. Theory says youre unlikely to find a poly-time algorithm. Must sacrifice one of three desired features.   Solve problem to optimality.   Solve problem in poly-time.   Solve arbitrary instances of the problem. ρ-approximation algorithm.   Guaranteed to run in poly-time.   Guaranteed to solve arbitrary instance of the problem   Guaranteed to find solution within ratio ρ of true optimum. Challenge. Need to prove a solutions value is close to optimum

文档评论(0)

1亿VIP精品文档

相关文档