On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint
Authors:
- 11 December 2021
- book chapter
- Published by Springer Nature
- p. 75-85
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem2017
- 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
- Profit-maximizing cluster hires2014
- Online team formation in social networks2012
- Finding a team of experts in social networks2009
- Combinatorial auctions with decreasing marginal utilitiesGames and Economic Behavior, 2006
- Submodular Functions, Matroids, and Certain Polyhedra2003
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Optimization, approximation, and complexity classesJournal of Computer and System Sciences, 1991