scientific article; zbMATH DE number 6851883

DOI10.4230/LIPICS.MFCS.2016.50MaRDI QIDQ4608613zbMATH OpenWikidataFDO

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

Publication date 21 March 2018

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2016.50

zbMATH Keywords

approximation algorithmshypergraphsmaximum coverage problemsponsored searchsubmodular optimization

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25) Auctions, bargaining, bidding and selling, and other market models (91B26)

Recommendations

• The budgeted maximum coverage problem
• The multi-budget maximum weighted coverage problem
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Approximations for restrictions of the budgeted and generalized maximum coverage problems
• Approximation algorithms for maximum coverage with group budget constraints
• Maximum coverage problem with group budget constraints
• The generalized maximum coverage problem
• Efficient approximation algorithms for maximum coverage with group budget constraints
• Allocating costs in set covering problems

Cited in

(8)

• The budgeted maximum coverage problem
• Maximum coverage problem with group budget constraints
• Judgement theorems and an approach for solving the constellation-to-ground coverage problem
• Generalized budgeted submodular set function maximization
• The multi-budget maximum weighted coverage problem
• scientific article; zbMATH DE number 1953104 (Why is no real title available?)
• Generalized budgeted submodular set function maximization
• Budgeted maximum coverage with overlapping costs: monitoring the emerging infections network

This page was built for publication:

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