Complexity of Source-Sink Monotone 2-parameter min cut
Open Access
- 1 January 2022
- journal article
- research article
- Published by Elsevier in Operations Research Letters
- Vol. 50 (1) , 84-90
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Natural Sciences and Engineering Research Council of Canada
This publication has 9 references indexed in Scilit:
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphsMathematical Programming, 2015
- Structural and algorithmic properties for parametric minimum cutsMathematical Programming, 2011
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum FlowOperations Research, 1999
- Computing maximum mean cutsDiscrete Applied Mathematics, 1994
- Scheduling jobs to minimize total costEuropean Journal of Operational Research, 1994
- A fast algorithm for the generalized parametric minimum cut problem and applicationsAlgorithmica, 1992
- A Fast Parametric Maximum Flow Algorithm and ApplicationsSIAM Journal on Computing, 1989
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983
- Minimizing a Submodular Function on a LatticeOperations Research, 1978