An accelerated sequential algorithm for producing D-optimal designs
SIAM Journal on Scientific and Statistical Computing
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
The Data-Correcting Algorithm for the Minimization of Supermodular Functions
Management Science
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Simulated Annealing in Convex Bodies and an 0*(n4) Volume Algorithm
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Simulated Annealing for Convex Optimization
Mathematics of Operations Research
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems
SIAM Journal on Computing
Optimal approximation for the submodular welfare problem in the value oracle model
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Adaptive simulated annealing: A near-optimal connection between sampling and counting
Journal of the ACM (JACM)
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Symmetry and Approximability of Submodular Maximization Problems
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Submodular Function Minimization under Covering Constraints
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Improved inapproximability for submodular maximization
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Mathematics of Operations Research
Optimal auctions with positive network externalities
Proceedings of the 12th ACM conference on Electronic commerce
Submodular function maximization via the multilinear relaxation and contention resolution schemes
Proceedings of the forty-third annual ACM symposium on Theory of computing
Nonmonotone submodular maximization via a structural continuous greedy algorithm
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Improved competitive ratios for submodular secretary problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Improved approximations for k-exchange systems
ESA'11 Proceedings of the 19th European conference on Algorithms
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Submodular functions are noise stable
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Optimization with demand oracles
Proceedings of the 13th ACM Conference on Electronic Commerce
Submodular Approximation: Sampling-based Algorithms and Lower Bounds
SIAM Journal on Computing
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Optimal Auctions with Positive Network Externalities
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
Hi-index | 0.00 |
We consider the problem of maximizing a nonnegative (possibly non-monotone) submodular set function with or without constraints. Feige et al. [9] showed a 2/5-approximation for the unconstrained problem and also proved that no approximation better than 1/2 is possible in the value oracle model. Constant-factor approximation has been also known for submodular maximization subject to a matroid independence constraint (a factor of 0.309 [33]) and for submodular maximization subject to a matroid base constraint, provided that the fractional base packing number ν is bounded away from 1 (a 1/4-approximation assuming that ν ≥ 2 [33]). In this paper, we propose a new algorithm for submodular maximization which is based on the idea of simulated annealing. We prove that this algorithm achieves improved approximation for two problems: a 0.41-approximation for unconstrained submodular maximization, and a 0.325-approximation for submodular maximization subject to a matroid independence constraint. On the hardness side, we show that in the value oracle model it is impossible to achieve a 0.478-approximation for submodular maximization subject to a matroid independence constraint, or a 0.394-approximation subject to a matroid base constraint in matroids with two disjoint bases. Even for the special case of cardinality constraint, we prove it is impossible to achieve a 0.491-approximation. (Previously it was conceivable that a 1/2-approximation exists for these problems.) It is still an open question whether a 1/2-approximation is possible for unconstrained submodular maximization.