Maximize a monotone function with a generic submodularity ratio

DOI10.1007/978-3-030-27195-4_23OpenAlexW2966183690MaRDI QIDQ6199021

Tao Sun, Qizhi Fang, Suning Gong, Xiaoyu Shao, Qingqin Nong, Ding-Zhu Du

Publication date: 23 February 2024

Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-27195-4_23

zbMATH Keywords

greedy algorithmnon-submodularityindependent system

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (3)

A linear-time streaming algorithm for cardinality-constrained maximizing monotone non-submodular set functions ⋮ An optimal streaming algorithm for non-submodular functions maximization on the integer lattice ⋮ Approximation guarantees for parallelized maximization of monotone non-submodular function with a cardinality constraint

This page was built for publication: Maximize a monotone function with a generic submodularity ratio