Publication:4633865
From MaRDI portal
zbMath1423.90230MaRDI QIDQ4633865
Ariel Kulik, Tami Tamir, Hadas Shachnai
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496830
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W25: Approximation algorithms
Related Items
Submodular Functions: Learnability, Structure, and Optimization, Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model, Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location, Maximizing a Monotone Submodular Function with a Bounded Curvature under a Knapsack Constraint, Unnamed Item, Approximation for maximizing monotone non-decreasing set functions with a greedy method, Improved streaming algorithms for maximizing monotone submodular functions under a knapsack constraint, Maximization of nonsubmodular functions under multiple constraints with applications, Improved deterministic algorithms for non-monotone submodular maximization, Multi-level facility location as the maximization of a submodular set function, Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms, An accelerated continuous greedy algorithm for maximizing strong submodular functions, Non-monotone submodular function maximization under \(k\)-system constraint, Multi-pass streaming algorithms for monotone submodular function maximization, Algorithms for influence maximization in socio-physical networks, Multiple knapsack-constrained monotone DR-submodular maximization on distributive lattice -- continuous greedy algorithm on median complex --, Measured continuous greedy with differential privacy, Fractional 0-1 programming and submodularity, Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint, Submodular optimization problems and greedy strategies: a survey, Discrete optimization methods for group model selection in compressed sensing, Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint, Strategyproof mechanisms for competitive influence in networks, Optimization with demand oracles, Bulk-robust combinatorial optimization, Limitations of randomized mechanisms for combinatorial auctions, Streaming submodular maximization under \(d\)-knapsack constraints, Maximizing coverage while ensuring fairness: a tale of conflicting objectives, Submodularity and Randomized rounding techniques for Optimal Experimental Design, A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
