Polynomial combinatorial algorithms for skew-bisubmodular function minimization (Q1785196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-017-1171-2 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On structures of bisubmodular polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of bisubmodular functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm and symmetric matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudomatroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some combinatorial properties of discriminants in metric vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy algorithm for solving a certain class of linear programmes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular functions and optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisubmodular Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem for Transversal Submodular Functions and Its Implications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized skew bisubmodularity: a characterization and a min-max theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete convexity and polynomial solvability in minimum 0-extension problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Minimizing k-Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oracle Tractability of Skew Bisubmodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew Bisubmodularity and Valued CSPs / 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: Submodularity on a Tree: Unifying $L^\natural$ -Convex and Bisubmodular Functions / 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: On the complexity of submodular function minimisation on diamonds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed submodularity, ditroids and directed submodular flows / 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: The Complexity of Valued Constraint Satisfaction Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-017-1171-2 / rank
 
Normal rank

Latest revision as of 11:28, 11 December 2024

scientific article
Language Label Description Also known as
English
Polynomial combinatorial algorithms for skew-bisubmodular function minimization
scientific article

    Statements

    Polynomial combinatorial algorithms for skew-bisubmodular function minimization (English)
    0 references
    0 references
    0 references
    28 September 2018
    0 references
    skew-bisubmodular functions
    0 references
    submodular functions
    0 references
    discrete convexity
    0 references
    combinatorial algorithms
    0 references
    strongly polynomial algorithms
    0 references
    0 references

    Identifiers