Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (Q408438): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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 / OpenAlex ID
 
Property / OpenAlex ID: W2052876922 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1101.2973 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 0. 828-approximation algorithm for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch \& bound method for the uncapacitated competitive location problem / 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: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / 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: Q5684698 / 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: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent rounding and its applications to approximation algorithms / 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: A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem / 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: Q4633865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints / 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: Q5365102 / 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: Q3549686 / rank
 
Normal rank

Latest revision as of 02:05, 5 July 2024

scientific article
Language Label Description Also known as
English
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
scientific article

    Statements

    Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2012
    0 references
    0 references
    non-monotone submodular set functions
    0 references
    approximation algorithms
    0 references
    continuous greedy process
    0 references
    matroid
    0 references
    knapsack
    0 references
    cardinality
    0 references
    0 references
    0 references