on the bottleneck shortest path problem

on the bottleneck shortest path problem

ID:33722116

大小:199.24 KB

页数:9页

时间:2019-02-28

on the bottleneck shortest path problem_第1页
on the bottleneck shortest path problem_第2页
on the bottleneck shortest path problem_第3页
on the bottleneck shortest path problem_第4页
on the bottleneck shortest path problem_第5页
资源描述:

《on the bottleneck shortest path problem》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、Konrad-Zuse-ZentrumTakustraße7D-14195Berlin-DahlemGermanyfurInformationstechnikBerlin¨VOLKERKAIBELMATTHIASA.F.PEINHARDTOntheBottleneckShortestPathProblemSupportedbytheDFGResearchCenterMATHEONinBerlinZIB-Report06-22(May2006)ONTHEBOTTLENECKSHORTESTPATHPROBLEMVOLKERKAIBELANDMATTH

2、IASA.F.PEINHARDTAbstract.TheBottleneckShortestPathProblemisabasicprobleminnetworkoptimization.Thegoalistodeterminethelimitingcapaci-tyofanypathbetweentwospecifiedverticesofthenetwork.Thisisequivalenttodeterminingtheunsplittablemaximumflowbetweenthetwovertices.Inthisnoteweanalyze

3、thecomplexityoftheproblem,itsrelationtotheShortestPathProblem,andtheimpactoftheunderlyingmachine/computationmodel.1.IntroductionTheBottleneckShortestPathProblem(BSP)isatthecoreofanumberofnetworkoptimizationproblems.Theperformanceofalgorithmsforitissometimescrucialfortherunning

4、timesofalgorithmsforhigherlevelprob-lemsinwhichitoccursasasubproblem.Twoexamplesarethek–splittableflowproblem[4](wheretherunningtimeoftheunderlyingBSPalgorithmappearsasafactorintheworstcaserunningtimeboundofthepresentedalgorithm)andtheMaxFlowProblem[2,Chapter7].Asoutlinedin[2],

5、theasymptoticalworstcasebehaviouroftheEdmonds–KarpalgorithmcannotbeimprovedbyusingaBSPalgorithmforfindingaugmentingpaths,butitmightstillimprovethepracticalperformance.Westartwithaformaldefinitionoftheproblem.LetG=(V,E)beagraph,eitherdirectedorundirected,withintegraledgeweightsce

6、∈Nforalledgese∈E.Thecapacitybpofapathp(viewedasasetofedges)isgivenbybp:=mine∈pce.(Fortheemptypath,wedefineb∅=∞.)Withrespecttosomefixedstartvertexvertexs∈V,thebottleneckbvofavertexv∈Visbv:=maxpbp,whereprangesoverall(directed)pathsstartinginsandendinginv.Anedgethatdeterminesthecap

7、acityofapathorthebottleneckofavertex(i.e.,anedgeforwhichthecorrespondingminimumisattained)iscalledcriticalforthepathorvertex,respectively.TheBottleneckShortestPathProblem(BSP)istodetermine,foragivengraphG=(V,E),edgeweightsce∈N(e∈E),andastartvertexs∈V,thebottleneckbtofsomespeci

8、fiedtargetvertext.Ifwearegiventhebottle-neckbtofsomevertextthe

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

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

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