Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise

DOI10.1007/978-3-031-16081-3_12MaRDI QIDQ6167013zbMATH OpenFDO

Authors Mengxue Geng, Shufang Gong, Bin Liu, Weili Wu

Publication date 7 July 2023

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-16081-3_12

zbMATH Keywords

bicriteria algorithmlinear functionnoisesubmodular function

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Algorithms for maximizing monotone submodular function minus modular function under noise
• Submodular Maximization Subject to a Knapsack Constraint Under Noise Models
• Two-stage submodular maximization problem beyond non-negative and monotone
• Regularized nonmonotone submodular maximization
• Maximizing the differences between a monotone DR-submodular function and a linear function on the integer lattice

Cites work

• A note on maximizing a submodular set function subject to a knapsack constraint
• Comments on bases in dependence structures
• Guess free maximization of submodular and linear sums
• scientific article; zbMATH DE number 6474901 (Why is no real title available?)
• scientific article; zbMATH DE number 1953186 (Why is no real title available?)
• Maximizing Non-monotone Submodular Functions
• Near-optimal sensor placements in Gaussian processes: theory, efficient algorithms and empirical studies
• Optimal approximation for the submodular welfare problem in the value oracle model
• Simultaneous approximation of multi-criteria submodular function maximization

This page was built for publication: Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise

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