Pareto optimization for subset selection with dynamic cost constraints

We consider the subset selection problem for function f with constraint bound B that changes over time. Within the area of submodular optimization, various greedy approaches are commonly used. For dynamic environments we observe that the adaptive variants of these greedy approaches are not able to m...

Full description

Saved in:

Bibliographic Details
Published in:	Artificial intelligence Vol. 302; p. 103597
Main Authors:	Roostapour, Vahid, Neumann, Aneta, Neumann, Frank, Friedrich, Tobias
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 01.01.2022 Elsevier Science Ltd
Subjects:	Algorithms Approximation Empirical analysis Evolutionary algorithms Greedy algorithms Multi-objective optimization Multiple objective analysis Optimization Pareto optimization Polynomials Runtime analysis Social networks Submodular function Subset selection Submodular function Multi-objective optimization Runtime analysis Subset selection
ISSN:	0004-3702, 1872-7921
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!