scientific article; zbMATH DE number 1187161

MaRDI QIDQ3840368zbMATH OpenFDO

Authors Éva Tardos, Kevin D. Wayne

Publication date 10 August 1998

zbMATH Keywords

fat-path capacity-scaling algorithmgain-scaling techniquegeneralized maximum flow problempolynomial-time combinatorial algorithmspreflow-push algorithmTruemper's algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Recommendations

• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• Faster algorithms for the generalized network flow problem
• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• A generalization of the scaling max-flow algorithm
• New algorithms for generalized network flows

Cited in

(14)

• A decomposition algorithm to determine the maximum flow in a generalized network
• Improving time bounds on maximum generalised flow computations by contracting the network
• A generalization of the scaling max-flow algorithm
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
• Generalized max flow in series-parallel graphs
• Maximum flow problem in wireless ad hoc networks with directional antennas
• Faster algorithms for the generalized network flow problem
• Greedy approximation algorithms for generalized maximum flow problem towards relation extraction in information networks
• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• Generalized max flows and augmenting paths
• A simpler and faster strongly polynomial algorithm for generalized flow maximization
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• Generalized maximum flow over time with intermediate storage
• Quick max-flow algorithm

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 Q3840368)