Complexity of source-sink monotone 2-parameter min cut

DOI10.1016/j.orl.2021.12.009OpenAlexW4205949992MaRDI QIDQ2670479

Venus Lo, Maxwell Allman, S. Thomas McCormick

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2107.09743

zbMATH Keywords

network flowparametric flowmax flow/min cut

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

An approximation algorithm for a general class of multi-parametric optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Structural and algorithmic properties for parametric minimum cuts
• Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
• A fast algorithm for the generalized parametric minimum cut problem and applications
• Computing maximum mean cuts
• Scheduling jobs to minimize total cost
• Complexity of some parametric integer and network programming problems
• Minimizing a Submodular Function on a Lattice
• A Fast Parametric Maximum Flow Algorithm and Applications
• Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
• Smoothed Analysis of Multiobjective Optimization
• Multicriteria Optimization
• Enumerating parametric global minimum cuts by random interleaving

This page was built for publication: Complexity of source-sink monotone 2-parameter min cut