Multiway cuts in directed and node weighted graphs

This publication has 10 references indexed in Scilit:

• Approximate max-flow min-(multi)cut theorems and their applications
  Published by Association for Computing Machinery (ACM) ,1993
• Primal-dual approximation algorithms for integral flow and multicut in trees, with applications to matching and set cover
  Lecture Notes in Computer Science, 1993
• Proof verification and hardness of approximation problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1992
• The complexity of multiway cuts (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1992
• Optimization, approximation, and complexity classes
  Journal of Computer and System Sciences, 1991
• The optimal multiterminal cut problem
  Published by American Mathematical Society (AMS) ,1991
• On the multiway cut polyhedron
  Networks, 1991
• An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Cutting and partitioning a graph after a fixed pattern
  Published by Springer Nature ,1983
• Maximal Flow Through a Network
  Canadian Journal of Mathematics, 1956