A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
The budgeted maximum coverage problem
Information Processing Letters
Distributions on Level-Sets with Applications to Approximation Algorithms
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
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 submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
Maximizing submodular set functions subject to multiple linear constraints
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
Scheduling to minimize power consumption using submodular functions
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Near optimal multi-application allocation in shared sensor networks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Citation summarization through keyphrase extraction
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Selective call out and real time bidding
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Constrained non-monotone submodular maximization: offline and secretary algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Maximizing Nonmonotone Submodular Functions under Matroid or Knapsack Constraints
SIAM Journal on Discrete Mathematics
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
Multiple mobile data offloading through delay tolerant networks
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
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
ESA'11 Proceedings of the 19th European conference on Algorithms
ESA'11 Proceedings of the 19th European conference on Algorithms
Maximizing Non-monotone Submodular Functions
SIAM Journal on Computing
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Submodular maximization by simulated annealing
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The 1-neighbour knapsack problem
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
On k-column sparse packing programs
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
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
Maximizing a Monotone Submodular Function Subject to a Matroid Constraint
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
The knapsack problem with neighbour constraints
Journal of Discrete Algorithms
All-or-Nothing generalized assignment with application to scheduling advertising campaigns
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
Strategyproof mechanisms for competitive influence in networks
Proceedings of the 22nd international conference on World Wide Web
SPARSI: partitioning sensitive data amongst multiple adversaries
Proceedings of the VLDB Endowment
Towards social data platform: automatic topic-focused monitor for twitter stream
Proceedings of the VLDB Endowment
Hi-index | 0.00 |
The concept of submodularity plays a vital role in combinatorial optimization. In particular, many important optimization problems can be cast as submodular maximization problems, including maximum coverage, maximum facility location and max cut in directed/undirected graphs. In this paper we present the first known approximation algorithms for the problem of maximizing a nondecreasing submodular set function subject to multiple linear constraints. Given a d-dimensional budget vector [EQUATION], for some d ≥ 1, and an oracle for a non-decreasing submodular set function f over a universe U, where each element e ∈ U is associated with a d-dimensional cost vector, we seek a subset of elements S ⊆ U whose total cost is at most [EQUATION], such that f(S) is maximized. We develop a framework for maximizing submodular functions subject to d linear constraints that yields a (1 - ε)(1 - e−1)-approximation to the optimum for any ε 0, where d 1 is some constant. Our study is motivated by a variant of the classical maximum coverage problem that we call maximum coverage with multiple packing constraints. We use our framework to obtain the same approximation ratio for this problem. To the best of our knowledge, this is the first time the theoretical bound of 1 - e−1 is (almost) matched for both of these problems.