On the complexity of submodular function minimisation on diamonds
From MaRDI portal
Recommendations
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings
- On complexity of maximizatin of submodular functions*
- scientific article; zbMATH DE number 176870
- On submodular function minimization
- Towards minimizing \(k\)-submodular functions
- scientific article; zbMATH DE number 7051294
- On the complexity of approximating the diamond norm
- scientific article; zbMATH DE number 2119755
- A note on minimizing submodular functions
Cites work
- scientific article; zbMATH DE number 5485536 (Why is no real title available?)
- scientific article; zbMATH DE number 3904328 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 1953186 (Why is no real title available?)
- scientific article; zbMATH DE number 2086909 (Why is no real title available?)
- scientific article; zbMATH DE number 871947 (Why is no real title available?)
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A dichotomy theorem for maximum generalized satisfiability problems.
- An algorithm for weighted fractional matroid matching
- Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Cores of convex games
- Geometric algorithms and combinatorial optimization
- Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction
- Optimal cooperation and submodularity for computing Potts partition functions with a large number of states
- Rational and integral \(k\)-regular matrices.
- Submodular function minimization
- Submodular function minimization
- Submodular functions and optimization.
- Submodular functions in graph theory
- Supermodular functions and the complexity of MAX CSP
- The Approximability of Three-valued MAX CSP
- The approximability of MAX CSP with fixed-value constraints
- The capacity region of general multiple-access channel with certain correlated sources
- The complexity of soft constraint satisfaction
- The ellipsoid method and its consequences in combinatorial optimization
- Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
Cited in
(12)- Discrete convexity and polynomial solvability in minimum 0-extension problems
- The power of linear programming for general-valued CSPs
- Discrete convex functions on graphs and their algorithmic applications
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks
- Computing the nc-Rank via Discrete Convex Optimization on CAT(0) Spaces
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings
- On a general framework for network representability in discrete optimization
- A non-extendibility certificate for submodularity and applications
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with \(2 \times 2\) submatrices
- The complexity of valued CSPs
- A combinatorial algorithm for computing the rank of a generic partitioned matrix with 2 2 submatrices
This page was built for publication: On the complexity of submodular function minimisation on diamonds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q665998)
