Non-monotone submodular maximization under matroid and knapsack constraints
From MaRDI portal
Publication:5172726
DOI10.1145/1536414.1536459zbMath1304.90173arXiv0902.0353OpenAlexW2026338082MaRDI QIDQ5172726
Jon Lee, Viswanath Nagarajan, M. I. Sviridenko, Vahab S. Mirrokni
Publication date: 4 February 2015
Published in: Proceedings of the forty-first annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.0353
Related Items
Matroid and knapsack center problems, Envy-free pricing with general supply constraints for unit demand consumers, Measured continuous greedy with differential privacy, Structured Robust Submodular Maximization: Offline and Online Algorithms, Bounds on Double-Sided Myopic Algorithms for Unconstrained Non-monotoneSubmodular Maximization, Fair allocation of indivisible goods: beyond additive valuations, FPT approximation schemes for maximizing submodular functions, Optimization with demand oracles, Approximation with a fixed number of solutions of some multiobjective maximization problems, The knapsack problem with neighbour constraints, Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms, Evolutionary algorithms and submodular functions: benefits of heavy-tailed mutations, Submodular Maximization Through the Lens of Linear Programming, Unified Greedy Approximability beyond Submodular Maximization, Unified greedy approximability beyond submodular maximization, Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint, Unnamed Item, Sell or hold: A simple two-stage stochastic combinatorial optimization problem, Greedy guarantees for non-submodular function maximization under independent system constraint with applications, A framework of discrete DC programming by discrete convex analysis, Contact Center Scheduling with Strict Resource Requirements, Buyback Problem - Approximate Matroid Intersection with Cancellation Costs, Maximizing a submodular function with viability constraints, Non-monotone submodular function maximization under \(k\)-system constraint, Blocking rumor by cut, Viral marketing of online game by DS decomposition in social networks, Approximation for maximizing monotone non-decreasing set functions with a greedy method, A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints, Set function optimization, Maximizing submodular or monotone approximately submodular functions by multi-objective evolutionary algorithms, Private non-monotone submodular maximization, Informative path planning as a maximum traveling salesman problem with submodular rewards, Unnamed Item, An Optimal Streaming Algorithm for Submodular Maximization with a Cardinality Constraint, An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint
