Properties and algorithm of lattice pseudo-submodular functions

DOI10.1142/S0129054122460091MaRDI QIDQ6955222zbMATH OpenFDO

Authors Hongxiang Zhang, Chunlin Hao, Yu Cao, Gai-Di Li

Publication date 23 July 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054122460091

zbMATH Keywords

Frank-Wolfemonotonepolytope constraintpseudo-submodular

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27)

Cites work

• A Unified Continuous Greedy Algorithm for Submodular Maximization
• An optimal approximation for submodular maximization under a matroid constraint in the adaptive complexity model
• scientific article; zbMATH DE number 7788401 (Why is no real title available?)
• Minimizing a Submodular Function on a Lattice
• Parametric monotone function maximization with matroid constraints
• Submodular function maximization in parallel via the multilinear relaxation
• Submodular maximization with cardinality constraints

Cited in

(1)

• The budget-feasible mechanisms on non-monotone k-submodular objectives for the offline and online procurement auctions

This page was built for publication: Properties and algorithm of lattice pseudo-submodular functions

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