An approximate max-flow min-cut relation for undirected multicommodity flow, with applications

This publication has 23 references indexed in Scilit:

• Approximation algorithms for combinatorial problems
  Published by Elsevier ,2007
• On the contact-minimization-problem
  Published by Springer Nature ,2005
• The maximum concurrent flow problem
  Journal of the ACM, 1990
• The via minimization problem is NP-complete
  IEEE Transactions on Computers, 1989
• Graph Bipartization and via minimization
  SIAM Journal on Discrete Mathematics, 1989
• A graph-theoretic via minimization algorithm for two-layer printed circuit boards
  IEEE Transactions on Circuits and Systems, 1983
• Min-Max Results in Combinatorial Optimization
  Published by Springer Nature ,1983
• New problems complete for nondeterministic log space
  Theory of Computing Systems, 1976
• Tough graphs and hamiltonian circuits
  Discrete Mathematics, 1973
• A note on the maximum flow through a network
  IEEE Transactions on Information Theory, 1956