Separating coverage and submodular: maximization subject to a cardinality constraint
From MaRDI portal
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- A Unified Continuous Greedy Algorithm for Submodular Maximization
- An analysis of approximations for maximizing submodular set functions—I
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Approximating CSPs with global cardinality constraints using SDP hierarchies
- Automata, Languages and Programming
- Balanced max 2-sat might not be the hardest
- Best Algorithms for Approximating the Maximum of a Submodular Set Function
- Better balance by being biased: a 0.8776-approximation for {\textsc{Max Bisection}}
- Comparing apples and oranges: query trade-off in submodular maximization
- Constrained submodular maximization via a nonsymmetric technique
- Constrained submodular maximization: beyond 1/e
- Dependent randomized rounding via exchange properties of combinatorial structures
- Deterministic Algorithms for Submodular Maximization Problems
- Fast algorithms for maximizing submodular functions
- From convex optimization to randomized mechanisms, toward optimal combinatorial auctions
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder
- scientific article; zbMATH DE number 6474901 (Why is no real title available?)
- scientific article; zbMATH DE number 1342117 (Why is no real title available?)
- scientific article; zbMATH DE number 2086914 (Why is no real title available?)
- Limitations of randomized mechanisms for combinatorial auctions
- Maximizing a monotone submodular function subject to a matroid constraint
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
- Maximizing Non-monotone Submodular Functions
- Online Submodular Maximization with Free Disposal
- Online submodular maximization with preemption
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- Submodular maximization with cardinality constraints
- Symmetry and approximability of submodular maximization problems
- The budgeted maximum coverage problem
- Tight approximability of MAX 2-SAT and relatives, under UGC
This page was built for publication: Separating coverage and submodular: maximization subject to a cardinality constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880133)
