有预算限制的最大并行流问题Maximum Concurrent Flow Problem with Budget Constraint
金鹤;赵大宇;
摘要(Abstract)：
改进了Garg N和K nemann给出的求解具有预算限制的最大并行流问题的近似算法,使得算法求出的目标函数值的近似性由原来的λ≥(1-ε)3OPT改进为λ≥1/(1+3ε)OPT,更接近最优值,而算法复杂性不变.给出数值例子,验证了算法改进的有效性.
关键词(KeyWords)： 有预算限制的最大并行流;近似算法;算法复杂性
基金项目(Foundation): 辽宁省高等学校科学研究基金资助项目(202112020)
作者(Author): 金鹤;赵大宇;
Email:
参考文献(References)：
- [1]FREDMAN M L,TARJAN R E.Fibonacci heaps and their use in improved network optimization problems[J].Journalof the ACM,1987,34(2):596-615.
- [2]SHAHROKHI F,MATULA D W.The maximum concurrent flow problem[J].JACM,1990,37(3):318-334.
- [3]LEIGHTON T,MAKEDON F,PLOTKIN S,et al.Fast approximation schemes for multicommodity flow problems[J].JCSS,1995,50(4):228-243.
- [4]GARG N,K NEMANN J.Faster and simpler algorithms for multicommodity flow and other fractional packingprograms[A].In 39th Annual IEEE Symposium on Foundations of Computer Science[C].1998:300-309.
- [5]FLEISCHER L.Approximating fractional multicommodity flow independent of the number of commodities[J].SIAMJournal on Discrete Mathematics,2000,13(4):505-520.