Structural and algorithmic properties for parametric minimum cuts
From MaRDI portal
Publication:715078
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 795224 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3197631 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A Faster Deterministic Maximum Flow Algorithm
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- A Selection Problem of Shared Fixed Costs and Network Flows
- A comparison of phase and nonphase network flow algorithms
- A fast algorithm for the generalized parametric minimum cut problem and applications
- A faster parametric minimum-cut algorithm
- A new approach to the maximum-flow problem
- A note on the parametric maximum flow problem and some related reoptimization issues
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- A simple version of Karzanov's blocking flow algorithm
- Algorithms – ESA 2005
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Complexity of some parametric integer and network programming problems
- Computing maximum mean cuts
- Critical Load Factors in Two-Processor Distributed Systems
- Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
- Generalization of a theorem on the parametric maximum flow problem
- Improved Algorithms for Bipartite Network Flow
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Minimizing a Submodular Function on a Lattice
- Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
- Monotone Comparative Statics
- Network flows. Theory, algorithms, and applications.
- On Convex Minimization over Base Polytopes
- On Nonlinear Fractional Programming
- On network flow functions
- Ordered optimal solutions and parametric minimum cut problems
- Parametric flows, weighted means of cuts, and fractional combinatorial optimization
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Selected Applications of Minimum Cuts in Networks
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Universally maximum flow with piecewise-constant capacities
Cited in
(18)- Complexity of source-sink monotone 2-parameter min cut
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- scientific article; zbMATH DE number 7650221 (Why is no real title available?)
- A stronger lower bound on parametric minimum spanning trees
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Minimum cuts in parametric networks
- An optimal algorithm for the minimum edge cardinality cut surface problem
- A fluid model for one-sided bipartite matching queues with match-dependent rewards
- Lattice flows in networks
- On structural parameterizations of the matching cut problem
- Maximum flows in parametric graph templates
- Parametric min-cuts analysis in a network.
- Computing the Map of Geometric Minimal Cuts
- Ordered optimal solutions and parametric minimum cut problems
- Enumerating parametric global minimum cuts by random interleaving
- Fully-dynamic min-cut
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)
