On the complexity of submodular function minimisation on diamonds (Q665998): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2011.04.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1973005928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cores of convex games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity region of general multiple-access channel with certain correlated sources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal cooperation and submodularity for computing Potts  partition functions with a large number of states / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of submodular programs: A fenchel-type min-max theorem and subgradients of submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5292089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Supermodular Functions on Product Lattices, with Application to Maximum Constraint Satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supermodular functions and the complexity of MAX CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximability of MAX CSP with fixed-value constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximability of Three-valued MAX CSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dichotomy theorem for maximum generalized satisfiability problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of soft constraint satisfaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-Triangularizations of Partitioned Matrices Under Similarity/Equivalence Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem and a Dulmage–Mendelsohn Type Decomposition for a Class of Generic Partitioned Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational and integral \(k\)-regular matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for weighted fractional matroid matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875222 / rank
 
Normal rank

Latest revision as of 23:01, 4 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of submodular function minimisation on diamonds
scientific article

    Statements

    On the complexity of submodular function minimisation on diamonds (English)
    0 references
    0 references
    7 March 2012
    0 references
    submodular function minimization
    0 references
    lattices
    0 references
    diamonds
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers