The ground-set-cost budgeted maximum coverage problem

DOI10.1007/S00224-025-10248-5MaRDI QIDQ6879182zbMATH OpenFDO

Authors Irving van Heuven van Staereling, Bart de Keijzer, Guido Schäfer

Publication date 2 January 2026

Published in Theory of Computing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

approximation algorithmshypergraphssponsored searchmaximum coverage problemsubmodular optimization

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26) Approximation algorithms (68W25) Hypergraphs (05C65)

This page was built for publication: The ground-set-cost budgeted maximum coverage problem

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