Matches in SemOpenAlex for { <https://semopenalex.org/work/W4288357875> ?p ?o ?g. }
Showing items 1 to 68 of
68
with 100 items per page.
- W4288357875 abstract "Numerous combinatorial optimization problems (knapsack, maximum-weight matching, etc.) can be expressed as emph{subset maximization problems}: One is given a ground set $N={1,dots,n}$, a collection $mathcal{F}subseteq 2^N$ of subsets thereof such that $emptysetinmathcal{F}$, and an objective (profit) function $p:mathcal{F}rightarrowmathbb{R}_+$. The task is to choose a set $Sinmathcal{F}$ that maximizes $p(S)$. We consider the emph{multistage} version (Eisenstat et al., Gupta et al., both ICALP 2014) of such problems: The profit function $p_t$ (and possibly the set of feasible solutions $mathcal{F}_t$) may change over time. Since in many applications changing the solution is costly, the task becomes to find a sequence of solutions that optimizes the trade-off between good per-time solutions and stable solutions taking into account an additional similarity bonus. As similarity measure for two consecutive solutions, we consider either the size of the intersection of the two solutions or the difference of $n$ and the Hamming distance between the two characteristic vectors. We study multistage subset maximization problems in the emph{online} setting, that is, $p_t$ (along with possibly $mathcal{F}_t$) only arrive one by one and, upon such an arrival, the online algorithm has to output the corresponding solution without knowledge of the future. We develop general techniques for online multistage subset maximization and thereby characterize those models (given by the type of data evolution and the type of similarity measure) that admit a constant-competitive online algorithm. When no constant competitive ratio is possible, we employ lookahead to circumvent this issue. When a constant competitive ratio is possible, we provide almost matching lower and upper bounds on the best achievable one." @default.
- W4288357875 created "2022-07-29" @default.
- W4288357875 creator A5020410268 @default.
- W4288357875 creator A5036828195 @default.
- W4288357875 creator A5056422606 @default.
- W4288357875 creator A5063171222 @default.
- W4288357875 date "2019-05-10" @default.
- W4288357875 modified "2023-09-30" @default.
- W4288357875 title "Online Multistage Subset Maximization Problems" @default.
- W4288357875 doi "https://doi.org/10.48550/arxiv.1905.04162" @default.
- W4288357875 hasPublicationYear "2019" @default.
- W4288357875 type Work @default.
- W4288357875 citedByCount "0" @default.
- W4288357875 crossrefType "posted-content" @default.
- W4288357875 hasAuthorship W4288357875A5020410268 @default.
- W4288357875 hasAuthorship W4288357875A5036828195 @default.
- W4288357875 hasAuthorship W4288357875A5056422606 @default.
- W4288357875 hasAuthorship W4288357875A5063171222 @default.
- W4288357875 hasBestOaLocation W42883578751 @default.
- W4288357875 hasConcept C113138325 @default.
- W4288357875 hasConcept C114614502 @default.
- W4288357875 hasConcept C118615104 @default.
- W4288357875 hasConcept C126255220 @default.
- W4288357875 hasConcept C14036430 @default.
- W4288357875 hasConcept C162324750 @default.
- W4288357875 hasConcept C175444787 @default.
- W4288357875 hasConcept C181622380 @default.
- W4288357875 hasConcept C193319292 @default.
- W4288357875 hasConcept C2524010 @default.
- W4288357875 hasConcept C2776330181 @default.
- W4288357875 hasConcept C2777780509 @default.
- W4288357875 hasConcept C2781302577 @default.
- W4288357875 hasConcept C33923547 @default.
- W4288357875 hasConcept C78458016 @default.
- W4288357875 hasConcept C86803240 @default.
- W4288357875 hasConceptScore W4288357875C113138325 @default.
- W4288357875 hasConceptScore W4288357875C114614502 @default.
- W4288357875 hasConceptScore W4288357875C118615104 @default.
- W4288357875 hasConceptScore W4288357875C126255220 @default.
- W4288357875 hasConceptScore W4288357875C14036430 @default.
- W4288357875 hasConceptScore W4288357875C162324750 @default.
- W4288357875 hasConceptScore W4288357875C175444787 @default.
- W4288357875 hasConceptScore W4288357875C181622380 @default.
- W4288357875 hasConceptScore W4288357875C193319292 @default.
- W4288357875 hasConceptScore W4288357875C2524010 @default.
- W4288357875 hasConceptScore W4288357875C2776330181 @default.
- W4288357875 hasConceptScore W4288357875C2777780509 @default.
- W4288357875 hasConceptScore W4288357875C2781302577 @default.
- W4288357875 hasConceptScore W4288357875C33923547 @default.
- W4288357875 hasConceptScore W4288357875C78458016 @default.
- W4288357875 hasConceptScore W4288357875C86803240 @default.
- W4288357875 hasLocation W42883578751 @default.
- W4288357875 hasLocation W42883578752 @default.
- W4288357875 hasOpenAccess W4288357875 @default.
- W4288357875 hasPrimaryLocation W42883578751 @default.
- W4288357875 hasRelatedWork W2001839669 @default.
- W4288357875 hasRelatedWork W2022568122 @default.
- W4288357875 hasRelatedWork W2043933006 @default.
- W4288357875 hasRelatedWork W2107216979 @default.
- W4288357875 hasRelatedWork W2609801364 @default.
- W4288357875 hasRelatedWork W2944508191 @default.
- W4288357875 hasRelatedWork W2978070678 @default.
- W4288357875 hasRelatedWork W3168198497 @default.
- W4288357875 hasRelatedWork W4281747859 @default.
- W4288357875 hasRelatedWork W4282006399 @default.
- W4288357875 isParatext "false" @default.
- W4288357875 isRetracted "false" @default.
- W4288357875 workType "article" @default.