A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

A Combinatorial Approximation Algorithm for the Multicommodity Flow Problem

Abstract

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
Origin Files produced by the author(s)

Dates and versions

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

Identifiers

Cite

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⟩
131 View
188 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More