Approximation Algorithms

Approximation Algorithms

ID:39910004

大小:874.09 KB

页数:119页

时间:2019-07-14

Approximation Algorithms_第1页
Approximation Algorithms_第2页
Approximation Algorithms_第3页
Approximation Algorithms_第4页
Approximation Algorithms_第5页
资源描述:

《Approximation Algorithms》由会员上传分享,免费在线阅读,更多相关内容在学术论文-天天文库

1、ApproximationAlgorithmsVijayV.VaziraniCollegeofComputingGeorgiaInstituteofTechnologyPreliminaryandIncompleteCopyright1997(acknowledgements,credits,referencesmissing)Contents1Introduction::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::3ICOMBINATORIALALGORITHMS2Setcoveranditsa

2、pplicationtoshortestsuperstring:::::::::::::::::::::::::::113MetricSteinertreeandTSP:::::::::::::::::::::::::::::::::::::::::::::::::::::164Multiwaycutsandk-cuts:::::::::::::::::::::::::::::::::::::::::::::::::::::::::215Facilitylocationproblems::::::::::::::::::::::::::::::::::::::::::::::::::::::

3、:::266Feedbackvertexset::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::317Shortestsuperstring:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::378Knapsack:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::439Minimummakespanscheduling:::::::::::::

4、::::::::::::::::::::::::::::::::::::::47IILPBASEDALGORITHMS10IntroductiontoLP-duality::::::::::::::::::::::::::::::::::::::::::::::::::::::::5211Roundingappliedtosetcover::::::::::::::::::::::::::::::::::::::::::::::::::::5912LP-dualitybasedanalysisforsetcover:::::::::::::::::::::::::::::::::::::::

5、:::6313Theprimal-dualschema:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::6914Multicutandintegermulticommodity owintrees::::::::::::::::::::::::::::7315Steinerforest:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::7916Steinernetwork:::::::::::::::::::::::::::::::::

6、:::::::::::::::::::::::::::::::::::8717Multicutingeneralgraphs::::::::::::::::::::::::::::::::::::::::::::::::::::::::9712CONTENTS18Sparsestcut::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::106Chapter1IntroductionThisbookdealswithdesigningpolynomialtimeapproximationalgorith

7、msforNP-hardoptimiza-1tionproblems.Typically,thedecisionversionsoftheseproblemsareinNP,andarethereforeNP-complete.Fromtheviewpointofexactsolutions,allNP-completeproblemsareequallyhard,sincetheyareinter-redu

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。