Minimal multicut and maximal integer multiflow: A survey

@article{Costa2005MinimalMA,
  title={Minimal multicut and maximal integer multiflow: A survey},
  author={Marie-Christine Costa and Lucas L{\'e}tocart and Fr{\'e}d{\'e}ric Roupin},
  journal={European Journal of Operational Research},
  year={2005},
  volume={162},
  pages={55-69}
}
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… CONTINUE READING
BETA

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

156 Citations

01020'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 156 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-10 OF 66 REFERENCES

L

  • M.-C. Costa
  • L etocart, F. Roupin, A greedy algorithm for…
  • 2003
Highly Influential
4 Excerpts

The complexity of multiway cuts

  • E. Dalhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis
  • SIAM Journal of Computers 23
  • 1994
Highly Influential
10 Excerpts

Polynomial algorithms to solve the multiway cut and integer flow problems on trees

  • M.-C. Costa
  • ECCO XV, Lugano. CEDRIC report
  • 2002
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…