Q5111710 (Q5111710): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Beating ratio 0.5 for weighted oblivious matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Small Vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for online vector bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On k-Column Sparse Packing Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Maximization with Preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Primal-Dual Algorithms for Covering and Packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Submodular Maximization Problem with Vector Packing Constraint. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Bipartite Matching with Decomposable Weights / 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: Q4633942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds for Online Preemptive Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Stochastic Packing Applied to Display Ad Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling with preemption or non-completion penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource constrained scheduling as generalized bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online unweighted knapsack problem with removal cost / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for online knapsack problems / 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: Optimal Resource Augmentations for Online Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal beats dual on online packing LPs in the random-order model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of Online Packing Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inapproximability of b-Matching in k-Uniform Hypergraphs / rank
 
Normal rank

Revision as of 19:30, 22 July 2024

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

    Statements

    0 references
    0 references
    0 references
    0 references
    27 May 2020
    0 references
    0 references
    submodular maximization
    0 references
    free-disposal
    0 references
    vector packing
    0 references
    0 references
    0 references
    0 references
    0 references