scientific article; zbMATH DE number 7051223

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (31)

Submodularity and Randomized rounding techniques for Optimal Experimental Design ⋮ Strategyproof mechanisms for competitive influence in networks ⋮ A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization ⋮ 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 -- ⋮ Measured continuous greedy with differential privacy ⋮ Fractional 0-1 programming and submodularity ⋮ Submodular Functions: Learnability, Structure, and Optimization ⋮ Optimization with demand oracles ⋮ An accelerated continuous greedy algorithm for maximizing strong submodular functions ⋮ Streaming algorithm for maximizing a monotone non-submodular function under \(d\)-knapsack constraint ⋮ Maximizing non-monotone submodular set functions subject to different constraints: combined algorithms ⋮ Maximization of nonsubmodular functions under multiple constraints with applications ⋮ Streaming submodular maximization under \(d\)-knapsack constraints ⋮ Improved deterministic algorithms for non-monotone submodular maximization ⋮ Improved deterministic algorithms for non-monotone submodular maximization ⋮ Submodular optimization problems and greedy strategies: a survey ⋮ Unnamed Item ⋮ Maximizing coverage while ensuring fairness: a tale of conflicting objectives ⋮ Formulations and Approximation Algorithms for Multilevel Uncapacitated Facility Location ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Non-monotone submodular function maximization under \(k\)-system constraint ⋮ Approximation for maximizing monotone non-decreasing set functions with a greedy method ⋮ Bulk-robust combinatorial optimization ⋮ Limitations of randomized mechanisms for combinatorial auctions ⋮ Streaming algorithms for maximizing monotone submodular functions under a knapsack constraint ⋮ 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 ⋮ Multi-pass streaming algorithms for monotone submodular function maximization ⋮ Algorithms for influence maximization in socio-physical networks ⋮ Approximability of Monotone Submodular Function Maximization under Cardinality and Matroid Constraints in the Streaming Model

This page was built for publication: