On Maximizing the Difference Between an Approximately Submodular Function and a Linear Function Subject to a Matroid Constraint

[1]  Jan Vondrák,et al.  Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature , 2017, Math. Oper. Res..

[2]  Luca Becchetti,et al.  Online team formation in social networks , 2012, WWW.

[3]  Dachuan Xu,et al.  Simultaneous Approximation of Multi-criteria Submodular Function Maximization , 2014 .

[4]  Daniel Lehmann,et al.  Combinatorial auctions with decreasing marginal utilities , 2001, EC '01.

[5]  Danny Segev,et al.  Constrained Assortment Optimization Under the Markov Chain-based Choice Model , 2020, Manag. Sci..

[6]  Evimaria Terzi,et al.  An Efficient Framework for Balancing Submodularity and Cost , 2021, KDD.

[7]  Moran Feldman,et al.  Guess Free Maximization of Submodular and Linear Sums , 2018, Algorithmica.

[8]  Evimaria Terzi,et al.  Algorithms for Hiring and Outsourcing in the Online Labor Market , 2018, KDD.

[9]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[10]  Niv Buchbinder,et al.  Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid , 2019, SODA.

[11]  Theodoros Lappas,et al.  Finding a team of experts in social networks , 2009, KDD.

[12]  Theodoros Lappas,et al.  Profit-maximizing cluster hires , 2014, KDD.

[13]  Qizhi Fang,et al.  Parametric monotone function maximization with matroid constraints , 2019, Journal of Global Optimization.

[14]  Chung Keung Poon,et al.  A Simple Greedy Algorithm for the Profit-Aware Social Team Formation Problem , 2017, COCOA.

[15]  Frank Neumann,et al.  Greedy Maximization of Functions with Bounded Curvature under Partition Matroid Constraints , 2018, AAAI.