Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise
From MaRDI portal
Publication:6167013
DOI10.1007/978-3-031-16081-3_12zbMath1527.90187MaRDI QIDQ6167013
Bin Liu, Mengxue Geng, Weili Wu, Shufang Gong
Publication date: 7 July 2023
Published in: Algorithmic Aspects in Information and Management (Search for Journal in Brave)
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneous approximation of multi-criteria submodular function maximization
- A note on maximizing a submodular set function subject to a knapsack constraint
- Maximizing Non-monotone Submodular Functions
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
- Comments on bases in dependence structures
- Guess free maximization of submodular and linear sums
This page was built for publication: Bicriteria algorithms for maximizing the difference between submodular function and linear function under noise