Structural and algorithmic properties for parametric minimum cuts
From MaRDI portal
Publication:715078
DOI10.1007/S10107-011-0463-1zbMATH Open1269.90126OpenAlexW1999966159MaRDI QIDQ715078FDOQ715078
Authors: Frieda Granot, S. Thomas McCormick, Fabio Tardella, Maurice Queyranne 
Publication date: 15 October 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0463-1
Recommendations
Programming involving graphs or networks (90C35) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Network flows. Theory, algorithms, and applications.
- On Nonlinear Fractional Programming
- Title not available (Why is that?)
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Title not available (Why is that?)
- A new approach to the maximum-flow problem
- Minimizing a Submodular Function on a Lattice
- Monotone Comparative Statics
- A Fast Parametric Maximum Flow Algorithm and Applications
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Title not available (Why is that?)
- A Faster Deterministic Maximum Flow Algorithm
- Critical Load Factors in Two-Processor Distributed Systems
- Parametric flows, weighted means of cuts, and fractional combinatorial optimization
- Complexity of some parametric integer and network programming problems
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Improved Algorithms for Bipartite Network Flow
- Title not available (Why is that?)
- Algorithms – ESA 2005
- A Selection Problem of Shared Fixed Costs and Network Flows
- Universally maximum flow with piecewise-constant capacities
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- Selected Applications of Minimum Cuts in Networks
- A simple version of Karzanov's blocking flow algorithm
- Generalization of a theorem on the parametric maximum flow problem
- A note on the parametric maximum flow problem and some related reoptimization issues
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- A faster parametric minimum-cut algorithm
- Computing maximum mean cuts
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- A fast algorithm for the generalized parametric minimum cut problem and applications
- Ordered optimal solutions and parametric minimum cut problems
- A comparison of phase and nonphase network flow algorithms
- On Convex Minimization over Base Polytopes
- On network flow functions
Cited In (18)
- Complexity of source-sink monotone 2-parameter min cut
- Minimum cuts in parametric networks
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- A stronger lower bound on parametric minimum spanning trees
- Title not available (Why is that?)
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- Lattice flows in networks
- Ordered optimal solutions and parametric minimum cut problems
- Computing the Map of Geometric Minimal Cuts
- Parametric min-cuts analysis in a network.
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- Maximum flows in parametric graph templates
- Fully-dynamic min-cut
- An optimal algorithm for the minimum edge cardinality cut surface problem
- Enumerating parametric global minimum cuts by random interleaving
- On structural parameterizations of the matching cut problem
This page was built for publication: Structural and algorithmic properties for parametric minimum cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715078)
