Structural and algorithmic properties for parametric minimum cuts
- 26 June 2011
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 135 (1-2) , 337-367
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Experimental Evaluation of Parametric Max-Flow AlgorithmsLecture Notes in Computer Science, 2007
- Ordered optimal solutions and parametric minimum cut problemsDiscrete Optimization, 2005
- A push-relabel framework for submodular function minimization and applications to parametric optimizationDiscrete Applied Mathematics, 2003
- Characterizing the bit permutation networks obtained from the line digraphs of bit permutation networksNetworks, 2001
- Improved Algorithms for Bipartite Network FlowSIAM Journal on Computing, 1994
- Generalization of a theorem on the parametric maximum flow problemDiscrete Applied Mathematics, 1993
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight VectorMathematics of Operations Research, 1980
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- On Nonlinear Fractional ProgrammingManagement Science, 1967