Approximation Algorithms

《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