The Maximum Integer Multiterminal Flow Problem

DOI10.1007/11751595_78MaRDI QIDQ3600158zbMATH OpenOpenAlexFDO

Authors Cédric Bentz

Publication date 10 February 2009

Published in Computational Science and Its Applications - ICCSA 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11751595_78

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• The maximum integer multiterminal flow problem in directed graphs
• The Complexity of Multiterminal Cuts
• Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
• Multi-terminal maximum flows in node-capacitated networks
• Publication:4636548

Cited in

(9)

• On one maximum multiflow problem and related metrics
• Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs
• The maximum flow problem with disjunctive constraints
• scientific article; zbMATH DE number 634022 (Why is no real title available?)
• The multiroute maximum flow problem revisited
• Integer version of the multipath flow network synthesis problem
• The maximum integer multiterminal flow problem in directed graphs
• A maximum flow problem with intermediate node requirements
• Integer plane multiflow maximisation: one-quarter-approximation and gaps

This page was built for publication: The Maximum Integer Multiterminal Flow Problem

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