The budgeted maximum coverage problem
Information Processing Letters
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
Adaptive limited-supply online auctions
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
A multiple-choice secretary algorithm with applications to online auctions
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
SIAM Journal on Computing
On the submodularity of influence in social networks
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Matroids, secretary problems, and online mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing Non-Monotone Submodular Functions
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
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
Competitive Weighted Matching in Transversal Matroids
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
A Knapsack Secretary Problem with Applications
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Secretary problems: weights and discounts
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Stochastic Submodular Maximization
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Algorithms for Secretary Problems on Graphs and Hypergraphs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
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
Thresholded covering algorithms for robust and max-min optimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
SIAM Journal on Computing
Hiring a secretary from a poset
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
Contact center scheduling with strict resource requirements
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
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
Scheduling resources for throughput maximization
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
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
On variants of the matroid secretary problem
ESA'11 Proceedings of the 19th European conference on Algorithms
Improved approximations for k-exchange systems
ESA'11 Proceedings of the 19th European conference on Algorithms
Learning on a budget: posted price mechanisms for online procurement
Proceedings of the 13th ACM Conference on Electronic Commerce
Interviewing secretaries in parallel
Proceedings of the 13th ACM Conference on Electronic Commerce
Secretary problems with convex costs
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Advances on matroid secretary problems: free order model and laminar case
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Fast greedy algorithms in mapreduce and streaming
Proceedings of the twenty-fifth annual ACM symposium on Parallelism in algorithms and architectures
Recent advances on the matroid secretary problem
ACM SIGACT News
Submodular secretary problem and extensions
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.01 |
Constrained submodular maximization problems have long been studied, most recently in the context of auctions and computational advertising, with near-optimal results known under a variety of constraints when the submodular function is monotone. In this paper, we give constant approximation algorithms for the non-monotone case that work for p-independence systems (which generalize constraints given by the intersection of p matroids that had been studied previously), where the running time is poly(n, p). Our algorithms and analyses are simple, and essentially reduce non-monotone maximization to multiple runs of the greedy algorithm previously used in the monotone case. We extend these ideas to give a simple greedy-based constant factor algorithms for non-monotone submodular maximization subject to a knapsack constraint, and for (online) secretary setting (where elements arrive one at a time in random order and the algorithm must make irrevocable decisions) subject to uniform matroid or a partition matroid constraint. Finally, we give an O(log k) approximation in the secretary setting subject to a general matroid constraint of rank k.