On Odd Cuts and Plane Multicommodity Flows
From MaRDI portal
Publication:3893626
DOI10.1112/plms/s3-42.1.178zbMath0447.90026MaRDI QIDQ3893626
Publication date: 1981
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-42.1.178
90B10: Deterministic network models in operations research
Related Items
Improved approximations for the minimum-cut ratio and the flux, On cuts and matchings in planar graphs, Las Vegas RNC algorithms for unary weighted perfect matching and \(T\)-join problems, Tight integral duality gap in the Chinese postman problem, On shortest \(T\)-joins and packing \(T\)-cuts, Role of redundant constraints for improving dual bounds in polynomial optimization problems, A fast algorithm for maximum integral two-commodity flow in planar graphs, A note on the half-integral multiflow-problem restricted to minor-closed classes of graphs, How to tidy up a symmetric set-system by use of uncrossing operations, Minimum weight \((T,d)\)-joins and multi-joins, The disjoint shortest paths problem, On circuit decomposition of planar Eulerian graphs, On the integral 4-packing of \(T\)-cuts, Conservative weightings and ear-decompositions of graphs, On the complexity of the disjoint paths problem, Polynomial algorithms for (integral) maximum two-flows in vertex\(\backslash\)edge-capacitated planar graphs
