Q5009516 (Q5009516): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2969615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Non-monotone Submodular Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Continuous Greedy Algorithm for Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / 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: Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing submodular functions over families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating \(k\)-set packing / 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: Submodular Function Minimization under Covering Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability results for combinatorial auctions with submodular utility functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy \(\varDelta \)-approximation algorithm for covering with arbitrary constraints and submodular cost / 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: Submodular Maximization over Multiple Matroids via Generalized Exchange Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial auctions with decreasing marginal utilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682236 / 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: A combinatorial algorithm minimizing submodular functions in strongly polynomial time. / 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: Facility location with hierarchical facility costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry and Approximability of Submodular Maximization Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:47, 26 July 2024

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

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    submodular optimization
    0 references
    multi-agent
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references