Title :
Faster approximation algorithm for generalized maximum concurrent flow problem with budget constraint
Author :
Dong, Liwei ; Bian, Liying ; Tang, Hengyong
Author_Institution :
Shenyang Normal Univ., Shenyang
Abstract :
We present fully polynomial approximation algorithm for generalized maximum concurrent flow problem with budget constraint that run in time independent of the number of commodities k. We show that by modifying the algorithms by Karakostas and Fleischer. We can reduce their running time. At the same time the approximation solution of the new algorithm is closer to optimal value.
Keywords :
budgeting; constraint theory; optimisation; polynomial approximation; Fleischer algorithm; Karakostas algorithm; budget constraint; maximum concurrent flow problem; polynomial approximation algorithm; Algorithm design and analysis; Approximation algorithms; Computer networks; Costs; Educational institutions; Optimized production technology; Polynomials; Software algorithms; Throughput; budget constraint; complexity of algorithm; concurrent flow; fully polynomial approximation algorithm; gain factor; generalized; lossy network;
Conference_Titel :
Service Operations and Logistics, and Informatics, 2008. IEEE/SOLI 2008. IEEE International Conference on
Conference_Location :
Beijing
Print_ISBN :
978-1-4244-2012-4
Electronic_ISBN :
978-1-4244-2013-1
DOI :
10.1109/SOLI.2008.4686579
