Minimax inverse problems of minimum cuts

DOI10.1002/net.10000zbMath0992.90075OpenAlexW2157317613MaRDI QIDQ2782726

Maiko Shigeno

Publication date: 8 April 2002

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10000

zbMATH Keywords

parametric searchinverse optimizationmaximum mean cutminimum-cut problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Two strongly polynomial cut cancelling algorithms for minimum cost network flow
• Scaling algorithms for network problems
• Algorithms for the minimum cost circulation problem based on maximizing the mean improvement
• A new saling algorithm for the maximum mean cut problem
• Approximate binary search algorithms for mean cuts and cycles
• Computing maximum mean cuts
• Beyond the flow decomposition barrier
• A new approach to the maximum-flow problem
• Unnamed Item

This page was built for publication: Minimax inverse problems of minimum cuts