Online multi-commodity flow with high demands

Guy Even, Moti Medina

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (ONMCF), where the flow demands may be bigger than the edge capacities of the network. We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor. The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow. Two extensions are discussed: requests with known durations and machine scheduling.

Original languageEnglish
Title of host publicationApproximation and Online Algorithms - 10th International Workshop, WAOA 2012, Revised Selected Papers
Number of pages14
StatePublished - 2013
Externally publishedYes
Event10th International Workshop on Approximation and Online Algorithms, WAOA 2012 - Ljubljana, Slovenia
Duration: 13 Sep 201214 Sep 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7846 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Workshop on Approximation and Online Algorithms, WAOA 2012


  • Multi-commodity flow
  • Online algorithms
  • Primal-dual scheme


Dive into the research topics of 'Online multi-commodity flow with high demands'. Together they form a unique fingerprint.

Cite this