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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2008 IEEE International Conference on Service Operations and Logistics, and Informatics Jg. 1; S. 1186 - 1191
Hauptverfasser: Dong, Liwei, Liying Bian, Tang, Hengyong
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.10.2008
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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