Minimal multicut and maximal integer multiflow: a survey - Archive ouverte HAL Access content directly
Journal Articles EJOR Year : 2005

Minimal multicut and maximal integer multiflow: a survey

Abstract

We present a survey about the maximum integral multiflow and minimum multicut problems and their subproblems, such as the multiterminal cut and the unsplittable flow problems. We consider neither continuous multiflow nor minimum cost multiflow. Most of the results are very recent and some are new. We recall the dual relationship between both problems, give complexity results and algorithms, firstly in unrestricted graphs and secondly in several special graphs: trees, bipartite or planar graphs. A table summarizes the most important results. Keywords: Integer multicommodity flows; Minimum multicut; Multiway cut; Complexity; Approximation
Not file

Dates and versions

hal-01124670 , version 1 (06-03-2015)

Identifiers

  • HAL Id : hal-01124670 , version 1

Cite

Marie-Christine Costa, Lucas Létocart, Frédéric Roupin. Minimal multicut and maximal integer multiflow: a survey. EJOR, 2005, 162, pp.55-69. ⟨hal-01124670⟩

Collections

CNAM CEDRIC-CNAM
30 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More