A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem

Résumé

This work is motivated by the need for approximation algorithms for the integral multicommodity flow problem which arise in numerous optimization scenarios, including the design of telecommunication networks. We improve on one of the most efficient known combinatorial approximation algorithm for fractional multicommodity flow by using an incremental approach. This approach is validated by experimental results, which show a significant speed-up.
Fichier principal
Vignette du fichier
CRR-WAOA03.pdf (141.61 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00429176 , version 1 (01-11-2009)

Identifiants

Citer

David Coudert, Hervé Rivano, Xavier Roche. A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem. International Workshop on Approximation and Online Algorithms (WAOA'03), 2003, Budapest, Hungary. pp.193-230, ⟨10.1007/b95598⟩. ⟨inria-00429176⟩
128 Consultations
185 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More