Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (Q2942658): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1312.2173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum directed cuts in acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online maximum directed cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132252 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious algorithms for the maximum directed cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768265 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-monotone submodular maximization under matroid and knapsack constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best Algorithms for Approximating the Maximum of a Submodular Set Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Greedy Algorithms for MAX SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank

Latest revision as of 17:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
scientific article

    Statements

    Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization (English)
    0 references
    0 references
    0 references
    11 September 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references