CPAIOR07 Connections in Networks Hardness of Feasibility vs cpaior07连接网络的可行性和硬度.ppt

下载文档 降价啦

2
0
约1.15万字
约 31页
2018-04-17 发布于江西
举报
版权申诉
保障服务

CPAIOR07 Connections in Networks Hardness of Feasibility vs cpaior07连接网络的可行性和硬度.ppt

1、本文档共31页，可阅读全部内容。
2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。

May 25, 2007 CP-AI-OR 2007 Connections in Networks:Hardness of Feasibility vs. Optimality Jon Conrad, Carla P. Gomes,Willem-Jan van Hoeve, Ashish Sabharwal, Jordan Suter Cornell University CP-AI-OR Conference, May 2007 Brussels, Belgium Feasibility Testing Optimization Constraint satisfaction work often focuses on pure feasibility testing: Is there a solution? Find me one! In principle, can be used for optimization as well Worst-case complexity classes well understood Often finer-grained typical-case hardness also known(easy-hard-easy patterns, phase transitions) How does the picture change when problems combine both feasibility and optimization components? We study this in the context of connection networks Many positive results; some surprising ones! Outline of the Talk Worst-case vs. typical-case hardness Easy-hard-easy patterns; phase transition The Connection Subgraph Problem Motivation: economics and social networks Combining feasibility and optimality components Theoretical results (NP-hardness of approximation) Empirical study Easy-hard-easy patterns for pure optimality Phase transition Feasibility testing vs. optimization: a clear winner? Outline of the Talk Worst-case vs. typical-case hardness Easy-hard-easy patterns; phase transition The Connection Subgraph Problem Motivation: economics and social networks Combining feasibility and optimality components Theoretical results (NP-hardness of approximation) Empirical study Easy-hard-easy patterns for pure optimality Phase transition Feasibility testing vs. optimization: a clear winner? Typical-Case Complexity E.g. consider SAT, the Boolean Satisfiability Problem: Does a given formula have a satisfying truth assignment? Worst-case complexity: NP-complete Unless P = NP, cannot solve all instances in poly-time Of course, need solutions in practice anyway Typical-case complexity: a more detailed picture What about a majority of the instances? How about instances w.r.t. certain interesting para