Skip to main content
Article thumbnail
Location of Repository

The All-or-Nothing Multicommodity Flow Problem

By F. Bruce Shepherd Sanjeev Khanna Chandra Chekuri

Abstract

..., the same as that for edp [10]. Our algorithm extends to the case where each pair siti has a demand di associated with it and we need to completely route di to get credit for pair i. We also consider the online admission control version where pairs arrive online and the algorithm has to decide immediately on its arrival whether to accept it or not. We obtain a randomized algorithm with a competitive ratio that is similar to the approximation ratio for the offline algorithm

Year: 2004
OAI identifier: oai:CiteSeerX.psu:10.1.1.134.5342
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.mcgill.ca/~bsh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.