Online Multistage Subset Maximization Problems

Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as subset maximization problems : One is given a ground set N = { 1 , ⋯ , n } , a collection F ⊆ 2 N of subsets thereof such that ∅ ∈ F , and an objective (profit) function p : F → R + . The task...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 83; číslo 8; s. 2374 - 2399
Hlavní autori:	Bampis, Evripidis, Escoffier, Bruno, Schewior, Kevin, Teiller, Alexandre
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.08.2021 Springer Nature B.V Springer Verlag
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Matching Mathematics of Computing Maximization Optimization Similarity Similarity measures Theory of Computation Upper bounds Online algorithms Multistage Optimization Multistage optimization On-line algorithms
ISSN:	0178-4617, 1432-0541
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!