The multi-budget maximum weighted coverage problem (Q2692723): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3158827023 / 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: A 6/5-approximation algorithm for the maximum 3-cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5005131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / 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: The generalized maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum coverage problem with group budget constraints / 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: Monotone Submodular Maximization over a Matroid via Non-Oblivious Local Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2908875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / 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: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Welfare Games / 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: Q5009516 / 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
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2904748 / rank
 
Normal rank

Latest revision as of 19:21, 31 July 2024

scientific article
Language Label Description Also known as
English
The multi-budget maximum weighted coverage problem
scientific article

    Statements

    The multi-budget maximum weighted coverage problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2023
    0 references
    multi-budget coverage
    0 references
    maximum coverage
    0 references
    approximation algorithms
    0 references

    Identifiers