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

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 83; no. 8; pp. 2374 - 2399
Main Authors:	Bampis, Evripidis, Escoffier, Bruno, Schewior, Kevin, Teiller, Alexandre
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.08.2021 Springer Nature B.V Springer Verlag
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!