Online Submodular Maximization Problem with Vector Packing Constraint. (Q5111710): Difference between revisions

@@ label / en / label / en @@
+Online Submodular Maximization Problem with Vector Packing Constraint.
@@ Property / cites work @@
+Beating ratio 0.5 for weighted oblivious matching problems
+Normal rank
@@ Property / cites work @@
+Q5365114
@@ Property / cites work: Q5365114 / rank @@
+Normal rank
@@ Property / cites work @@
+Packing Small Vectors
@@ Property / cites work: Packing Small Vectors / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds for online vector bin packing
@@ Property / cites work: Tight bounds for online vector bin packing / rank @@
+Normal rank
@@ Property / cites work @@
+On k-Column Sparse Packing Programs
@@ Property / cites work: On k-Column Sparse Packing Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Online Submodular Maximization with Preemption
@@ Property / cites work: Online Submodular Maximization with Preemption / rank @@
+Normal rank
@@ Property / cites work @@
+Online Primal-Dual Algorithms for Covering and Packing
+Normal rank
@@ Property / cites work @@
+Online Submodular Maximization with Free Disposal: Randomization Beats ¼ for Partition Matroids
+Normal rank
@@ Property / cites work @@
+Online Submodular Maximization Problem with Vector Packing Constraint.
+Normal rank
@@ Property / cites work @@
+Online Bipartite Matching with Decomposable Weights
+Normal rank
@@ Property / cites work @@
+Submodular Function Maximization via the Multilinear Relaxation and Contention Resolution Schemes
+Normal rank
@@ Property / cites work @@
+Q4633942
@@ Property / cites work: Q4633942 / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized Primal-Dual Analysis of RANKING for Online Bipartite Matching
+Normal rank
@@ Property / cites work @@
+Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems
+Normal rank
@@ Property / cites work @@
+Improved Bounds for Online Preemptive Matching
@@ Property / cites work: Improved Bounds for Online Preemptive Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Online Stochastic Packing Applied to Display Ad Allocation
+Normal rank
@@ Property / cites work @@
+Online scheduling with preemption or non-completion penalties
+Normal rank
@@ Property / cites work @@
+Resource constrained scheduling as generalized bin packing
+Normal rank
@@ Property / cites work @@
+Online unweighted knapsack problem with removal cost
+Normal rank
@@ Property / cites work @@
+Randomized algorithms for online knapsack problems
+Normal rank
@@ Property / cites work @@
+On the complexity of approximating \(k\)-set packing
+Normal rank
@@ Property / cites work @@
+Optimal Resource Augmentations for Online Knapsack
+Normal rank
@@ Property / cites work @@
+Primal beats dual on online packing LPs in the random-order model
+Normal rank
@@ Property / cites work @@
+Geometry of Online Packing Linear Programs
@@ Property / cites work: Geometry of Online Packing Linear Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of b-Matching in k-Uniform Hypergraphs
+Normal rank
@@ Property / OpenAlex ID @@
+W2963788302
@@ Property / OpenAlex ID: W2963788302 / rank @@
+Normal rank
@@ Property / title @@
+Online Submodular Maximization Problem with Vector Packing Constraint. (English)
+Normal rank