hal.structure.identifier | | |
dc.contributor.author | Mahjoub, Ali Ridha | * |
hal.structure.identifier | | |
dc.contributor.author | McCormick, S. Thomas | * |
dc.date.accessioned | 2010-12-14T13:52:22Z | |
dc.date.available | 2010-12-14T13:52:22Z | |
dc.date.issued | 2010 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/5296 | |
dc.language.iso | en | en |
dc.subject | Min Cut | en |
dc.subject | Max Flow | en |
dc.subject | approximation algorithms | en |
dc.subject.ddc | 003 | en |
dc.title | Max Flow and Min Cut with bounded-length paths: complexity, algorithms, and approximation | en |
dc.type | Article accepté pour publication ou publié | |
dc.description.abstracten | We consider the “flow on paths” versions of Max Flow and Min Cut when we restrict to paths having at most B arcs, and for versions where we allow fractional solutions or require integral solutions. We show that the continuous versions are polynomial even if B is part of the input, but that the integral versions are polynomial only when B ≤ 3. However, when B ≤ 3 we show how to solve the problems using ordinary Max Flow/Min Cut. We also give tight bounds on the integrality gaps between the integral and continuous objective values for both problems, and between the continuous objective values for the bounded-length paths version and the version allowing all paths. We give a primal–dual approximation algorithm for both problems whose approximation ratio attains the integrality gap, thereby showing that it is the best possible primal–dual approximation algorithm. | en |
dc.relation.isversionofjnlname | Mathematical Programming | |
dc.relation.isversionofjnlvol | 124 | en |
dc.relation.isversionofjnlissue | 1-2 | en |
dc.relation.isversionofjnldate | 2010 | |
dc.relation.isversionofjnlpages | 271-284 | en |
dc.relation.isversionofdoi | http://dx.doi.org/10.1007/s10107-010-0366-6 | en |
dc.description.sponsorshipprivate | oui | en |
dc.relation.isversionofjnlpublisher | Springer | en |
dc.subject.ddclabel | Recherche opérationnelle | en |
hal.author.function | aut | |
hal.author.function | aut | |