We consider the emph{QoS-aware Multicommodity Flow} problem, a natural generalization of the weighted multicommodity flow problem where the demands and commodity values are elastic to the Quality-of-Service characteristics of the underlying network. The problem is fundamental in transportation planning and also has important applications beyond the transportation domain. We provide a FPTAS for the QoS-aware Multicommodity Flow problem by building upon a Lagrangian relaxation method and a recent FPTAS for the non-additive shortest path problem.
@InProceedings{tsaggouris_et_al:OASIcs.ATMOS.2006.682, author = {Tsaggouris, George and Zaroliagis, Christos}, title = {{QoS-aware Multicommodity Flows and Transportation Planning}}, booktitle = {6th Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS'06)}, pages = {1--14}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-01-9}, ISSN = {2190-6807}, year = {2006}, volume = {5}, editor = {Jacob, Riko and M\"{u}ller-Hannemann, Matthias}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2006.682}, URN = {urn:nbn:de:0030-drops-6827}, doi = {10.4230/OASIcs.ATMOS.2006.682}, annote = {Keywords: Quality of service, multicommodity flows, fully polynomial approximation scheme, transportation planning} }
Feedback for Dagstuhl Publishing