Bicriteria Algorithms for Maximizing the Difference Between Submodular Function and Linear Function Under Noise
- 18 September 2022
- book chapter
- Published by Springer Nature
- p. 133-143
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Optimal Approximation for Submodular and Supermodular Optimization with Bounded CurvatureMathematics of Operations Research, 2017
- Simultaneous Approximation of Multi-criteria Submodular Function MaximizationJournal of the Operations Research Society of China, 2014
- Maximizing Non-monotone Submodular FunctionsSIAM Journal on Computing, 2011
- Optimal approximation for the submodular welfare problem in the value oracle model2008
- Cost-effective outbreak detection in networks2007
- Near-optimal sensor placements in Gaussian processes2005
- A note on maximizing a submodular set function subject to a knapsack constraintOperations Research Letters, 2004
- Maximizing the spread of influence through a social network2003
- Submodular Functions, Matroids, and Certain Polyhedra2003
- Comments on bases in dependence structuresBulletin of the Australian Mathematical Society, 1969