Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (Q3012818): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1007/978-3-642-22006-7_29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1542515633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular function maximization via the multilinear relaxation and contention resolution schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / 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: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph cuts with interacting edge weights: examples, approximations, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / 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: Submodular Approximation: Sampling-based Algorithms and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the greedy algorithm for the submodular set covering problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:50, 4 July 2024

scientific article
Language Label Description Also known as
English
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
scientific article

    Statements

    Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm (English)
    0 references
    0 references
    0 references
    0 references
    6 July 2011
    0 references

    Identifiers