A note on maximizing a submodular set function subject to a knapsack constraint

Authors:
Maxim Sviridenko
Affiliations:
IBM, T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, NY 10598, USA
Venue:
Operations Research Letters
Year:
2004

Citing 4
Cited 50

A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem

Journal of the ACM (JACM)
The budgeted maximum coverage problem

Information Processing Letters
Constrained Maximum-Entropy Sampling

Operations Research

Tight approximation algorithms for maximum general assignment problems

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Cut problems in graphs with a budget constraint

Journal of Discrete Algorithms
Cost-effective outbreak detection in networks

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximizing influence in a competitive social network: a follower's perspective

Proceedings of the ninth international conference on Electronic commerce
Robust, low-cost, non-intrusive sensing and recognition of seated postures

Proceedings of the 20th annual ACM symposium on User interface software and technology
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
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies

The Journal of Machine Learning Research
Scalable video streaming for single-hop wireless networks uing a contention-based access MAC protocol

Advances in Multimedia
Maximizing submodular set functions subject to multiple linear constraints

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Bid optimization for broad match ad auctions

Proceedings of the 18th international conference on World wide web
Non-monotone submodular maximization under matroid and knapsack constraints

Proceedings of the forty-first annual ACM symposium on Theory of computing
Near-optimal observation selection using submodular functions

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Approximate nonmyopic sensor selection via submodularity and partitioning

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Investigations of continual computation

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Approximating minimum-power degree and connectivity problems

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Multi-document summarization via budgeted maximization of submodular functions

HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Near optimal multi-application allocation in shared sensor networks

Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Thresholded covering algorithms for robust and max-min optimization

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Submodular secretary problem and extensions

APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
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
Maximum betweenness centrality: approximability and tractable cases

WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximability of combinatorial problems with multi-agent submodular cost functions

ACM SIGecom Exchanges
Video distribution under multiple constraints

Theoretical Computer Science
Submodular function maximization via the multilinear relaxation and contention resolution schemes

Proceedings of the forty-third annual ACM symposium on Theory of computing
A class of submodular functions for document summarization

HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
Tight Approximation Algorithms for Maximum Separable Assignment Problems

Mathematics of Operations Research
Polynomial-time approximation schemes for maximizing gross substitutes utility under budget constraints

ESA'11 Proceedings of the 19th European conference on Algorithms
Submodular max-SAT

ESA'11 Proceedings of the 19th European conference on Algorithms
Maximizing Non-monotone Submodular Functions

SIAM Journal on Computing
On the approximability of budget feasible mechanisms

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Coping with interference: from maximum coverage to planning cellular networks

WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
The 1-neighbour knapsack problem

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Cut problems in graphs with a budget constraint

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Optimizing budget allocation among channels and influencers

Proceedings of the 21st international conference on World Wide Web
Optimizing index for taxonomy keyword search

SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Budget feasible mechanism design: from prior-free to bayesian

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Optimization with demand oracles

Proceedings of the 13th ACM Conference on Electronic Commerce
Learning on a budget: posted price mechanisms for online procurement

Proceedings of the 13th ACM Conference on Electronic Commerce
Approximation algorithms for fragmenting a graph against a stochastically-located threat

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
The submodular knapsack polytope

Discrete Optimization
Sensor allocation in diverse environments

Wireless Networks
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
Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs

Discrete Applied Mathematics
Strategyproof mechanisms for competitive influence in networks

Proceedings of the 22nd international conference on World Wide Web
Submodular secretary problem and extensions

ACM Transactions on Algorithms (TALG)
Towards social data platform: automatic topic-focused monitor for twitter stream

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we obtain an (1-e^-^1)-approximation algorithm for maximizing a nondecreasing submodular set function subject to a knapsack constraint. This algorithm requires O(n^5) function value computations.