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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Artificial intelligence Ročník 302; s. 103597
Hlavní autori:	Roostapour, Vahid, Neumann, Aneta, Neumann, Frank, Friedrich, Tobias
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Amsterdam Elsevier B.V 01.01.2022 Elsevier Science Ltd
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!