Approximation Algorithms for Minimum K-cut 7

Approximation Algorithms for Minimum K-cut 7

ID:39910015

大小:180.64 KB

页数:12页

时间:2019-07-14

Approximation Algorithms for Minimum K-cut 7_第1页
Approximation Algorithms for Minimum K-cut 7_第2页
Approximation Algorithms for Minimum K-cut 7_第3页
Approximation Algorithms for Minimum K-cut 7_第4页
Approximation Algorithms for Minimum K-cut 7_第5页
资源描述:

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

1、ApproximationalgorithmsforminimumK-cut1NiliGuttmann-BeckandRefaelHassinAbstractLetG=(V;E)beacompleteundirectedgraph,withnodesetV=fv;:::;vgand1nedgesetE.Theedges(v;v)2Ehavenon-negativeweightsthatsatisfythetriangleijPppinequality.GivenasetofintegersK=fkg(kjVj),theminimumK-cutiii=1i=1p

2、problemistocomputedisjointsubsetswithsizesfkg,minimizingthetotalweightii=1ofedgeswhosetwoendsareindi erentsubsets.Wedemonstratethatforany xedpitispossibletoobtaininpolynomialtimeanapproximationofatmost3timestheoptimalvalue.Wealsoproveboundsontheratiobetweentheweightsofmaximumandminim

3、umcuts.1IntroductionLetG=(V;E)beacompleteundirectedgraphwithnon-negativeedgeweightsl(e)e2E,PppandletKbeasetofppositiveintegersfkgsuchthatkjVj.AK-cutisacollec-iii=1i=1ptionofdisjointsetsfPgsuchthat8i2f1;:::;pgjPj=k.TheminimumK-cutproblemiiii=1PPPPp?1pisto ndaK-cutsuchthatl(P;P)(where

4、l(P;P)=l(v;u))isijijv2Pu2Pi=1j=i+1ijminimized.PpTheversionofthisprobleminwhichk=jVjandthesizesofthesetsarenotgivenii=1buttheirnumberisrequiredtobep,andpis xed,ispolynomiallysolvable[2].Whenp2ispartoftheinput,thisversionisNP-hard[1]andSaranandVazirani[3]gavea2?papproximationalgorithm.

5、If,inaddition,thesetsinthepartitionarerestrictedtobeofequalsize,theproblemisonlyknowntobeapproximablewithinjVj(p?1)=pbySaranandVazirani[3].WeconsidertheminimumK-cutproblemundertheassumptionthattheweightssatisfythetriangleinequality.TheproblemisstillNP-hardunderthisassumptionbecauseea

6、chgraphcanbemadetosatisfythetriangleinequalitywhilenotchangingtheproblembyPaddingahighenoughconstant(forexample,l(e))toalltheedgelengths.e2EWedemonstratethatforany xedpitispossibletoobtaininpolynomialtimeanapproximationofatmost3timestheoptimalvalue.1DepartmentofStatisticsandOperation

7、sResearch,TelAvivUniversity,TelAviv69978,Israel.fnili,hassing@math.tau.ac.il1PpSupposenowk=jVj(partitioningallthenodesinthegraph).Letl;lbeimaxmini=1lmaxtheweightsofthemaximumandminimumcutsinthegraph,respectively,andletr=.lminWeproveboundsonrforseveralinterestingcases,assumingthetrian

8、gleinequalit

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

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

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