- 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
您可能关注的文档
最近下载
- 老年人反诈安全教育PPT模版(图文).pptx VIP
- 全套SPC质量管理表格.xls VIP
- 人教PEP版六年级英语上册全套测试卷(配2026年秋改版教材).pdf
- 2025下半年四川省自然资源投资集团社会招聘笔试参考题库附答案解析.docx VIP
- 2025年国家电网招聘之其他工学类考试试卷附完整答案(历年真题)通用题.docx VIP
- CNG及LNG加气站风险管控资料.doc VIP
- 欧洲标准化委员会BS EN 01074-1-2000 (2004).pdf
- 腾讯云 ADP-FDE 考点梳理手册.docx VIP
- 机械设计基础- 认识轴承.pptx VIP
- 《公路自然灾害监测预警系统技术指南(试行)》.docx
原创力文档

文档评论(0)