Faster approximation algorithm for generalized maximum concurrent flow problem with budget constraint

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2008 IEEE International Conference on Service Operations and Logistics, and Informatics Ročník 1; s. 1186 - 1191
Hlavní autoři: Dong, Liwei, Liying Bian, Tang, Hengyong
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.10.2008
Témata:
Approximation algorithms
Approximation methods
budget constraint
complexity of algorithm
concurrent flow
Educational institutions
Electronic mail
fully polynomial approximation algorithm
Gain
gain factor
generalized
lossy network
Optimized production technology
Polynomials
ISBN:1424420121, 9781424420124
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1424420121
9781424420124
DOI:10.1109/SOLI.2008.4686579