Maximizing selection of overlapping alternatives

DOI10.1007/S43069-026-00670-XMaRDI QIDQ7300034zbMATH OpenFDO

Authors Erez Eliyahu, Zvika Neeman

Publication date 20 July 2026

Published in SN Operations Research Forum (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S43069-026-00670-X

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Cites work

• A note on maximizing a submodular set function subject to a knapsack constraint
• A refined analysis of submodular greedy
• A threshold of ln n for approximating set cover
• An analysis of approximations for maximizing submodular set functions—I
• Menu Auctions, Resource Allocation, and Economic Influence
• The budgeted maximum coverage problem

This page was built for publication: Maximizing selection of overlapping alternatives

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