Online Submodular Maximization with Preemption (Q4972676): Difference between revisions

@@ Property / OpenAlex ID @@
+W2950023069
@@ Property / OpenAlex ID: W2950023069 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.05801
@@ Property / arXiv ID: 1501.05801 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252265
@@ Property / cites work: Q4252265 / rank @@
+Normal rank
@@ Property / cites work @@
+An 0. 828-approximation algorithm for the uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Submodular Max-SAT
@@ Property / cites work: Submodular Max-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Online maximum directed cut
@@ Property / cites work: Online maximum directed cut / rank @@
+Normal rank
@@ Property / cites work @@
+Submodular secretary problem and extensions
@@ Property / cites work: Submodular secretary problem and extensions / rank @@
+Normal rank
@@ Property / cites work @@
+A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
+Normal rank
@@ Property / cites work @@
+Submodular Maximization with Cardinality Constraints
+Normal rank
@@ Property / cites work @@
+Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
+Normal rank
@@ Property / cites work @@
+Submodular maximization meets streaming: matchings, matroids, and more
+Normal rank
@@ Property / cites work @@
+A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
+Normal rank
@@ Property / cites work @@
+An efficient approximation for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Q4633942
@@ Property / cites work: Q4633942 / rank @@
+Normal rank
@@ Property / cites work @@
+Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
+Normal rank
@@ Property / cites work @@
+Q4132252
@@ Property / cites work: Q4132252 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2913805
@@ Property / cites work: Q2913805 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower and upper bounds on FIFO buffer management in QoS switches
+Normal rank
@@ Property / cites work @@
+Improved bounds for randomized preemptive online matching
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Oblivious algorithms for the maximum directed cut problem
+Normal rank
@@ Property / cites work @@
+Maximizing Non-monotone Submodular Functions
@@ Property / cites work: Maximizing Non-monotone Submodular Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Improved Competitive Ratios for Submodular Secretary Problems (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm
+Normal rank
@@ Property / cites work @@
+A Unified Continuous Greedy Algorithm for Submodular Maximization
+Normal rank
@@ Property / cites work @@
+Tight approximation algorithms for maximum general assignment problems
+Normal rank
@@ Property / cites work @@
+Online scheduling with preemption or non-completion penalties
+Normal rank
@@ Property / cites work @@
+Q5365102
@@ Property / cites work: Q5365102 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+Q2768265
@@ Property / cites work: Q2768265 / rank @@
+Normal rank
@@ Property / cites work @@
+Online unweighted knapsack problem with removal cost
+Normal rank
@@ Property / cites work @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization
+Normal rank
@@ Property / cites work @@
+Q4737165
@@ Property / cites work: Q4737165 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
+Normal rank
@@ Property / cites work @@
+Q3096108
@@ Property / cites work: Q3096108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737518
@@ Property / cites work: Q4737518 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4780789
@@ Property / cites work: Q4780789 / rank @@
+Normal rank
@@ Property / cites work @@
+Noise stability of functions with low influences: invariance and optimality
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Approximating the least core value and least core of cooperative games with supermodular costs
+Normal rank
@@ Property / cites work @@
+Gadgets, Approximation, and Linear Programming
@@ Property / cites work: Gadgets, Approximation, and Linear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Buyback Problem - Approximate Matroid Intersection with Cancellation Costs
+Normal rank
@@ Property / cites work @@
+Symmetry and Approximability of Submodular Maximization Problems
+Normal rank
@@ Property / Wikidata QID @@
+Q127735066
@@ Property / Wikidata QID: Q127735066 / rank @@
+Normal rank