Minimal multicut and maximal integer multiflow: a survey - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue EJOR Année : 2005

Minimal multicut and maximal integer multiflow: a survey

Résumé

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
Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-01124670 , version 1

Citer

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
38 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More