Maximizing submodular set functions subject to multiple linear constraints

zbMATH Open1423.90230MaRDI QIDQ4633865FDOQ4633865

Authors: Ariel Kulik, Hadas Shachnai, Tami Tamir

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496830

Recommendations

Maximizing nonmonotone submodular functions under matroid or knapsack constraints
Efficient Submodular Function Maximization under Linear Packing Constraints
Non-monotone submodular maximization under matroid and knapsack constraints
scientific article
Constrained submodular maximization via greedy local search

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (43)

Optimization with demand oracles
Improved deterministic algorithms for non-monotone submodular maximization
Algorithms for covering multiple submodular constraints and applications
Approximation for maximizing monotone non-decreasing set functions with a greedy method
Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms
Submodularity and randomized rounding techniques for optimal experimental design
Title not available (Why is that?)
A tight linear time (1/2)-approximation for unconstrained submodular maximization
Pareto optimization for subset selection with dynamic cost constraints
Submodular functions: learnability, structure, and optimization
Discrete optimization methods for group model selection in compressed sensing
Title not available (Why is that?)
A note on submodular function minimization with covering type linear constraints
Non-monotone submodular function maximization under \(k\)-system constraint
A note on the implications of approximate submodularity in discrete optimization
Bulk-robust combinatorial optimization
Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model
Submodular function minimization under a submodular set covering constraint
Strategyproof mechanisms for competitive influence in networks
Multi-level facility location as the maximization of a submodular set function
Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --
Limitations of randomized mechanisms for combinatorial auctions
An accelerated continuous greedy algorithm for maximizing strong submodular functions
Measured continuous greedy with differential privacy
Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Maximizing a monotone submodular function with a bounded curvature under a knapsack constraint
Fractional 0-1 programming and submodularity
Generalized budgeted submodular set function maximization
Submodular optimization problems and greedy strategies: a survey
Time-sharing scheduling with tolerance capacities
Efficient Submodular Function Maximization under Linear Packing Constraints
Submodular Maximization Through the Lens of Linear Programming
Multi-pass streaming algorithms for monotone submodular function maximization
Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint
Maximization of nonsubmodular functions under multiple constraints with applications
Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint
Maximizing a submodular function with viability constraints
Maximizing a class of submodular utility functions with constraints
Maximizing coverage while ensuring fairness: a tale of conflicting objectives
Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location
Algorithms for influence maximization in socio-physical networks
Streaming submodular maximization under \(d\)-knapsack constraints
Improved deterministic algorithms for non-monotone submodular maximization

This page was built for publication: Maximizing submodular set functions subject to multiple linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633865)