Matches in SemOpenAlex for { <https://semopenalex.org/work/W1590340002> ?p ?o ?g. }
Showing items 1 to 53 of
53
with 100 items per page.
- W1590340002 endingPage "164" @default.
- W1590340002 startingPage "155" @default.
- W1590340002 abstract "Admission control (call control) is a well-studied online problem. We are given a fixedgraph with edge capacities, and must process a sequence of calls that arrive over time, accepting some and rejecting others in order to stay within capacity limitations of the network. In the standardtheoretical formulation, this problem is analyzed as a benefit problem: the goal is to devise an online algorithm that accepts at least a reasonable fraction of the maximum number of calls that could possibly have been acceptedin hindsight. This formulation, however, has the property that even algorithms with optimal competitive ratios (typically O(log n)) may end up rejecting the vast majority of calls even when it would have been possible in hindsight to reject only very few.In this paper, we instead consider the goal of approximately minimizing the number of calls rejected. This is much more natural for real-world settings in which rejections are intended to be rare events. In order to avoid trivial lower-bounds, we assume preemption is allowed and that calls are given to the algorithm as fixed paths. We show that in a number of cases, we can in fact achieve a competitive ratio of 2 for rejections (so if the optimal in hindsight rejects 0 then we reject 0; if the optimal rejects r then we reject at most 2r). For other cases we get worse but nontrivial bounds. For the most general case of fixed paths in arbitrary graphs with arbitrary edge capacities, we achieve matching Θ(√m) upper and lower bounds. We also show a connection between these problems and online versions of the vertex-cover andset-co ver problems (our factor-2 results give 2-approximations to slight generalizations of the vertex cover problem, much as [AAA99] show hardness results for the benefit version based on the hardness of approximability of independent set)." @default.
- W1590340002 created "2016-06-24" @default.
- W1590340002 creator A5024803432 @default.
- W1590340002 creator A5055710645 @default.
- W1590340002 creator A5086904495 @default.
- W1590340002 date "2001-01-01" @default.
- W1590340002 modified "2023-09-24" @default.
- W1590340002 title "Admission Control to Minimize Rejections" @default.
- W1590340002 cites W1582510186 @default.
- W1590340002 cites W2096909875 @default.
- W1590340002 cites W2134620025 @default.
- W1590340002 cites W2173141774 @default.
- W1590340002 doi "https://doi.org/10.1007/3-540-44634-6_15" @default.
- W1590340002 hasPublicationYear "2001" @default.
- W1590340002 type Work @default.
- W1590340002 sameAs 1590340002 @default.
- W1590340002 citedByCount "14" @default.
- W1590340002 countsByYear W15903400022012 @default.
- W1590340002 countsByYear W15903400022014 @default.
- W1590340002 countsByYear W15903400022015 @default.
- W1590340002 crossrefType "book-chapter" @default.
- W1590340002 hasAuthorship W1590340002A5024803432 @default.
- W1590340002 hasAuthorship W1590340002A5055710645 @default.
- W1590340002 hasAuthorship W1590340002A5086904495 @default.
- W1590340002 hasBestOaLocation W15903400022 @default.
- W1590340002 hasConcept C154945302 @default.
- W1590340002 hasConcept C2775924081 @default.
- W1590340002 hasConcept C41008148 @default.
- W1590340002 hasConceptScore W1590340002C154945302 @default.
- W1590340002 hasConceptScore W1590340002C2775924081 @default.
- W1590340002 hasConceptScore W1590340002C41008148 @default.
- W1590340002 hasLocation W15903400021 @default.
- W1590340002 hasLocation W15903400022 @default.
- W1590340002 hasLocation W15903400023 @default.
- W1590340002 hasLocation W15903400024 @default.
- W1590340002 hasOpenAccess W1590340002 @default.
- W1590340002 hasPrimaryLocation W15903400021 @default.
- W1590340002 hasRelatedWork W2018297885 @default.
- W1590340002 hasRelatedWork W2093578348 @default.
- W1590340002 hasRelatedWork W2350741829 @default.
- W1590340002 hasRelatedWork W2358668433 @default.
- W1590340002 hasRelatedWork W2376932109 @default.
- W1590340002 hasRelatedWork W2382290278 @default.
- W1590340002 hasRelatedWork W2390279801 @default.
- W1590340002 hasRelatedWork W2748952813 @default.
- W1590340002 hasRelatedWork W2899084033 @default.
- W1590340002 hasRelatedWork W3004735627 @default.
- W1590340002 isParatext "false" @default.
- W1590340002 isRetracted "false" @default.
- W1590340002 magId "1590340002" @default.
- W1590340002 workType "book-chapter" @default.