Group equality and equity in submodular maximization

DOI10.1016/J.DAM.2025.10.048MaRDI QIDQ6885528zbMATH OpenFDO

Authors Yuanyuan Qiang, Bin Liu

Publication date 11 December 2025

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DAM.2025.10.048

zbMATH Keywords

approximation algorithmsfairness constraintsgroup equalitygroup equitysubmodular maximization

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• A threshold of ln n for approximating set cover
• An 0. 828-approximation algorithm for the uncapacitated facility location problem
• An analysis of approximations for maximizing submodular set functions—I
• Approximation algorithm for squared metric facility location problem with nonuniform capacities
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid
• Group equality in adaptive submodular maximization
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Submodular maximization by simulated annealing
• Submodular maximization with cardinality constraints

This page was built for publication: Group equality and equity in submodular maximization

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