Robust monotone submodular function maximization

We consider a robust formulation, introduced by Krause et al. (J Artif Intell Res 42:427–486, 2011 ), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results. The robustness considered is w.r.t. adversarial...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical programming Vol. 172; no. 1-2; pp. 505 - 537
Main Authors:	Orlin, James B., Schulz, Andreas S., Udwani, Rajan
Format:	Journal Article
Language:	English
Published:	Berlin/Heidelberg Springer Berlin Heidelberg 01.11.2018 Springer Nature B.V
Subjects:	Algorithms Approximation Calculus of Variations and Optimal Control; Optimization Combinatorics Full Length Paper Greedy algorithms Mathematical analysis Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Mathematics of Computing Maximization Numerical Analysis Queries Robustness Theoretical 90
ISSN:	0025-5610, 1436-4646
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!