A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (Q5091245): Difference between revisions

@@ label / en / label / en @@
+A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints
@@ Property / DOI @@
-.4230/LIPIcs.ICALP.2019.85
@@ Property / DOI: 10.4230/LIPIcs.ICALP.2019.85 / rank @@
-Normal rank
@@ Property / cites work @@
+An 0. 828-approximation algorithm for the uncapacitated facility location problem
+Normal rank
@@ Property / cites work @@
+Maximizing a class of submodular utility functions
+Normal rank
@@ Property / cites work @@
+Better Balance by Being Biased
@@ Property / cites work: Better Balance by Being Biased / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient approximation for the generalized assignment problem
+Normal rank
@@ Property / cites work @@
+Q4132252
@@ Property / cites work: Q4132252 / 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 @@
+Q2913805
@@ Property / cites work: Q2913805 / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Tight approximation algorithms for maximum general assignment problems
+Normal rank
@@ Property / cites work @@
+Q3499508
@@ Property / cites work: Q3499508 / 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 @@
+Some optimal inapproximability results
@@ Property / cites work: Some optimal inapproximability results / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2941641
@@ Property / cites work: Q2941641 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
+Normal rank
@@ Property / cites work @@
+The budgeted maximum coverage problem
@@ Property / cites work: The budgeted maximum coverage problem / rank @@
+Normal rank
@@ Property / cites work @@
+Determinantal Point Processes for Machine Learning
+Normal rank
@@ Property / cites work @@
+Approximations for Monotone and Nonmonotone Submodular Maximization with Knapsack Constraints
+Normal rank
@@ Property / cites work @@
+Non-monotone submodular maximization under matroid and knapsack constraints
+Normal rank
@@ Property / cites work @@
+An analysis of approximations for maximizing submodular set functions—I
+Normal rank
@@ Property / cites work @@
+Best Algorithms for Approximating the Maximum of a Submodular Set Function
+Normal rank
@@ Property / cites work @@
+Approximating the least core value and least core of cooperative games with supermodular costs
+Normal rank
@@ Property / cites work @@
+A note on maximizing a submodular set function subject to a knapsack constraint
+Normal rank
@@ Property / cites work @@
+Symmetry and Approximability of Submodular Maximization Problems
+Normal rank
@@ Property / cites work @@
+Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
+Normal rank
@@ Property / OpenAlex ID @@
+W2965600716
@@ Property / OpenAlex ID: W2965600716 / rank @@
+Normal rank
@@ Property / title @@
+A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints (English)
+Normal rank
@@ Property / DOI @@
+.4230/LIPICS.ICALP.2019.85
@@ Property / DOI: 10.4230/LIPICS.ICALP.2019.85 / rank @@
+Normal rank