scientific article; zbMATH DE number 2086913

MaRDI QIDQ4737516zbMATH OpenFDO

Authors Oktay Günlük

Publication date 11 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2337/23370054.htm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
• Improved bounds on the max-flow min-cut ratio for multicommodity flows
• Improved approximations for the minimum-cut ratio and the flux
• On the Max-flow min-cut ratio for directed multicommodity flows
• Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs

Cited in

(10)

• Improved bounds on the max-flow min-cut ratio for multicommodity flows
• Models and methods for solving the problem of network vulnerability
• Polynomiality of sparsest cuts with fixed number of sources
• On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• Problems and invariants connected with bicliques and multicliques of graphs
• A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows
• Affine routing for robust network design
• Improved bounds for the max-flow min-multicut ratio for planar and \(K_{r,r}\)-free graphs
• On the Max-flow min-cut ratio for directed multicommodity flows

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737516)