Q5075815 (Q5075815): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Hadas Shachnai / rank
Normal rank
 
Property / author
 
Property / author: Hadas Shachnai / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Approximation Bounds for the Seminar Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing items into several bins facilitates approximating the separable assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Submodular Maximization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Submodular Maximization Problems / 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 Polynomial Time Approximation Scheme for the Multiple Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601880 / 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: A Unified Continuous Greedy Algorithm for Submodular Maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Approximation Algorithms for Maximum Separable Assignment Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods in Combinatorial Optimization / 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: Q5009517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:49, 28 July 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    11 May 2022
    0 references
    0 references
    group generalized assignment problem
    0 references
    submodular maximization
    0 references
    knapsack constraints
    0 references
    approximation algorithms
    0 references