SIAM Journal on Discrete Mathematics
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
On Local Search for Weighted K-Set Packing
Mathematics of Operations Research
A combinatorial algorithm minimizing submodular functions in strongly polynomial time
Journal of Combinatorial Theory Series B
Greedy local improvement and weighted set packing approximation
Journal of Algorithms
A combinatorial strongly polynomial algorithm for minimizing submodular functions
Journal of the ACM (JACM)
A d/2 approximation for maximum weight independent set in d-claw free graphs
Nordic Journal of Computing
On the complexity of approximating k-set packing
Computational Complexity
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
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
Non-monotone submodular maximization under matroid and knapsack constraints
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
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
Word alignment via submodular maximization over matroids
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: short papers - Volume 2
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
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
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
| Hi-index | 0.00 |
In this paper, we consider the problem of maximizing a non-negative submodular function f , defined on a (finite) ground set N , subject to matroid constraints. A function $f: 2^N \rightarrow {\mathbb R}$ is submodular if for all S , T *** N , f (S *** T ) + f (S *** T ) ≤ f (S ) + f (T ). Furthermore, all submodular functions that we deal with are assumed to be non-negative. Throughout, we assume that our submodular function f is given by a value oracle ; i.e., for a given set S *** N , an algorithm can query an oracle to find the value f (S ). Without loss of generality, we take the ground set N to be [n ] = {1,2,...,n }.