scientific article; zbMATH DE number 7051294
From MaRDI portal
Publication:4633938
Recommendations
- scientific article; zbMATH DE number 2119755
- A fully combinatorial algorithm for submodular function minimization.
- scientific article; zbMATH DE number 876702
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- scientific article; zbMATH DE number 910864
- scientific article; zbMATH DE number 5319970
- On submodular function minimization
- Towards minimizing k-submodular functions
Cited in
(38)- A note on Schrijver's submodular function minimization algorithm.
- Complexity and approximations for submodular minimization problems on two variables per inequality constraints
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A fully combinatorial algorithm for submodular function minimization.
- A note on submodular function minimization by Chubanov's LP algorithm
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings
- Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
- Discrete Newton's algorithm for parametric submodular function minimization
- Every finite distributive lattice is isomorphic to the minimizer set of an \(M^\natural \)-concave set function
- Tractability in constraint satisfaction problems: a survey
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract)
- Partition Constrained Covering of a Symmetric Crossing Supermodular Function by a Graph
- Improved algorithms for submodular function minimization and submodular flow
- scientific article; zbMATH DE number 5319970 (Why is no real title available?)
- scientific article; zbMATH DE number 1757955 (Why is no real title available?)
- Submodular functions: learnability, structure, and optimization
- Geometric rescaling algorithms for submodular function minimization
- A Faster Scaling Algorithm for Minimizing Submodular Functions
- scientific article; zbMATH DE number 2086909 (Why is no real title available?)
- A framework of discrete DC programming by discrete convex analysis
- Geometric rescaling algorithms for submodular function minimization
- Inferring relative ability from winning probability in multientrant contests
- The complexity of valued CSPs
- Submodular functions and valued constraint satisfaction problems over infinite domains
- Efficient solution methods for a general \(r\)-interdiction median problem with fortification
- Hypergraph Cuts with General Splitting Functions
- Finding submodularity hidden in symmetric difference
- Algorithms for single machine scheduling problem with release dates and submodular penalties
- Minimizing convex functions with rational minimizers
- \textsc{Greedy+Max}: an efficient approximation algorithm for \(k\)-submodular knapsack maximization
- On the complexity of submodular function minimisation on diamonds
- A branch-and-cut algorithm for the multiple Steiner TSP with order constraints
- Shortest cycles with monotone submodular costs
- Polynomial algorithms to minimize 2/3-submodular functions
- Minimizing a sum of submodular functions
- Weakly polynomial-time algorithms to minimize 2/3-submodular functions
- A faster parametric search for the integral quickest transshipment problem
- The expressive power of binary submodular functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633938)
