polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew

polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew

ID:34425628

大小:133.91 KB

页数:10页

时间:2019-03-06

polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew_第1页
polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew_第2页
polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew_第3页
polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew_第4页
polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew_第5页
资源描述:

《polynomial time approximation schemes for euclidean tsp and other geometricproblemsnew》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、PolynomialTimeApproximationSchemesforEuclideanTSPandotherGeometricProblemsSanjeevAroraPrincetonUniversitytheTSP'snastiness(cf.PAbstractDcompleteness[37]andPLS-completeness[20]).WepresentapolynomialtimeapproximationschemeforButTSPinstancesarisinginpracticeareusuallyquit

2、eEuclideanTSPin2<.Givenanynnodesintheplanespecial,sothehardnessresultsmaynotnecessarilyapplytoand>0,thescheme®ndsa(1+)-approximationthem.InmetricTSPthenodeslieinametricspace(i.e.,thetotheoptimumtravelingsalesmantourintimeO(1=).ndistancessatisfythetriangleinequality).

3、InEuclideanTSPd2Whenthenodesareind<,therunningtimeincreasesto(ormoregenerally,inthenodesliein<

4、metricTSP.approximationinpolynomialtime.Unfortunately,evenEuclideanTSPisNP-hard(Papadim-Wealsogivesimilarapproximationschemesforahostitriou[35],Garey,Graham,andJohnson[12]).ThereforeofotherEuclideanproblems,includingSteinerTree,k-TSP,algorithmdesignerswereleftwithnochoi

5、cebuttocon-Minimumdegree-kspanningtree,k-MST,etc.(Thislistmaysidermoremodestnotionsofaªgood"solution.Karp[24],getlonger;ourtechniquesarefairlygeneral.)Theprevi-inaseminalworkonprobabilisticanalysisofalgorithms,ousbestapproximationalgorithmsforalltheseproblemsshowedthatw

6、henthennodesarepickeduniformlyandachievedaconstant-factorapproximation.independentlyfromunitsquare,thenthe®xeddissectionAllouralgorithmsalsowork,withalmostnomodi®ca-heuristicwithhighprobability®ndstourswhosecostistion,whendistanceismeasuredusinganygeometricnormwithin1+

7、ofoptimal(where>0isarbitrarilysmall).(suchasChristo®des[9]designedanapproximationalgorithmthat`forp1orotherMinkowskinorms).poneveryinstanceofmetricTSPcomputesatourofcostatmost1:5timestheoptimum.1IntroductionTwodecadesofresearchfailedtoimproveuponChristo®des'algorithmf

8、ormetricTSP.Butsomere-searcherscontinuedtohopethatevenaPTASmightex-IntheTravelingSalesmanProblem(ªTSP"),weareg

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

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

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