Q5091245 (Q5091245): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
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: Maximizing a class of submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Balance by Being Biased / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approximation for the generalized assignment problem / 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: Q2913805 / 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: Tight approximation algorithms for maximum general assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3499508 / 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: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2941641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The budgeted maximum coverage problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determinantal Point Processes for Machine Learning / 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: An analysis of approximations for maximizing submodular set functions—I / 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: Approximating the least core value and least core of cooperative games with supermodular costs / 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: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems / rank
 
Normal rank

Revision as of 17:41, 29 July 2024

scientific article; zbMATH DE number 7561578
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7561578

    Statements

    0 references
    0 references
    0 references
    0 references
    21 July 2022
    0 references
    submodular function
    0 references
    approximation algorithm
    0 references
    covering
    0 references
    packing
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers