Matches in SemOpenAlex for { <https://semopenalex.org/work/W4247656554> ?p ?o ?g. }
Showing items 1 to 76 of
76
with 100 items per page.
- W4247656554 abstract "Consider the following edge-orientation problem: edges of a graph appear online one-by-one and they to be directed—given an “orientation”. We want to ensure that the in-degree of each vertex remains low. (This is a simple case of scheduling unit-sized jobs on machines, where each job can only go on one of two machines.) If the edge-orientations we assign are irrevocable, we suffer a significant loss in quality due to online decision-making (as compared to the offline performance). For instance the best online competitive ratio achievable is Θ(log m) for even this toy problem.But what if the decisions are not irrevocable — what if we allow a limited number of reassignments? Can we do much better? We show that indeed we can. For instance, for edge-orientation, we can achieve a constant-competitive load while doing only a constant number of re-orientations per edge (in an amortized sense). For more substantial problems, our results are as follows:•For online matching, where the left vertices arrive online and must be matched to the right vertices, we give an algorithm that reassigns the left vertices an (amortized) constant number of times, and maintains a constant factor to the optimal load on the right vertices. We extend this to restricted machine scheduling with arbitrary sized jobs and give an algorithm that maintains load which is O(log log mn) times the optimum, and reassigns each job only an (amortized) constant number of times.•Consider a digraph with a single source, where sinks arrive online and want to send unit flow to the source. The goal is to minimize the congestion on the edges. Suppose there is an offline flow such that the total length of the flow paths is F*. We give an algorithm that reroutes flow along O(F*) edges and achieves a O(1)-approximation to the congestion." @default.
- W4247656554 created "2022-05-12" @default.
- W4247656554 creator A5054641291 @default.
- W4247656554 creator A5076100445 @default.
- W4247656554 creator A5078381067 @default.
- W4247656554 date "2013-12-18" @default.
- W4247656554 modified "2023-09-26" @default.
- W4247656554 title "Maintaining Assignments Online: Matching, Scheduling, and Flows" @default.
- W4247656554 doi "https://doi.org/10.1137/1.9781611973402.35" @default.
- W4247656554 hasPublicationYear "2013" @default.
- W4247656554 type Work @default.
- W4247656554 citedByCount "14" @default.
- W4247656554 countsByYear W42476565542014 @default.
- W4247656554 countsByYear W42476565542015 @default.
- W4247656554 countsByYear W42476565542018 @default.
- W4247656554 countsByYear W42476565542020 @default.
- W4247656554 countsByYear W42476565542021 @default.
- W4247656554 countsByYear W42476565542023 @default.
- W4247656554 crossrefType "proceedings-article" @default.
- W4247656554 hasAuthorship W4247656554A5054641291 @default.
- W4247656554 hasAuthorship W4247656554A5076100445 @default.
- W4247656554 hasAuthorship W4247656554A5078381067 @default.
- W4247656554 hasConcept C102408133 @default.
- W4247656554 hasConcept C11413529 @default.
- W4247656554 hasConcept C114614502 @default.
- W4247656554 hasConcept C118615104 @default.
- W4247656554 hasConcept C126255220 @default.
- W4247656554 hasConcept C132525143 @default.
- W4247656554 hasConcept C134306372 @default.
- W4247656554 hasConcept C142417499 @default.
- W4247656554 hasConcept C162319229 @default.
- W4247656554 hasConcept C196921405 @default.
- W4247656554 hasConcept C199360897 @default.
- W4247656554 hasConcept C206729178 @default.
- W4247656554 hasConcept C2777027219 @default.
- W4247656554 hasConcept C2779145032 @default.
- W4247656554 hasConcept C33923547 @default.
- W4247656554 hasConcept C41008148 @default.
- W4247656554 hasConcept C63553672 @default.
- W4247656554 hasConcept C77553402 @default.
- W4247656554 hasConcept C80899671 @default.
- W4247656554 hasConceptScore W4247656554C102408133 @default.
- W4247656554 hasConceptScore W4247656554C11413529 @default.
- W4247656554 hasConceptScore W4247656554C114614502 @default.
- W4247656554 hasConceptScore W4247656554C118615104 @default.
- W4247656554 hasConceptScore W4247656554C126255220 @default.
- W4247656554 hasConceptScore W4247656554C132525143 @default.
- W4247656554 hasConceptScore W4247656554C134306372 @default.
- W4247656554 hasConceptScore W4247656554C142417499 @default.
- W4247656554 hasConceptScore W4247656554C162319229 @default.
- W4247656554 hasConceptScore W4247656554C196921405 @default.
- W4247656554 hasConceptScore W4247656554C199360897 @default.
- W4247656554 hasConceptScore W4247656554C206729178 @default.
- W4247656554 hasConceptScore W4247656554C2777027219 @default.
- W4247656554 hasConceptScore W4247656554C2779145032 @default.
- W4247656554 hasConceptScore W4247656554C33923547 @default.
- W4247656554 hasConceptScore W4247656554C41008148 @default.
- W4247656554 hasConceptScore W4247656554C63553672 @default.
- W4247656554 hasConceptScore W4247656554C77553402 @default.
- W4247656554 hasConceptScore W4247656554C80899671 @default.
- W4247656554 hasLocation W42476565541 @default.
- W4247656554 hasOpenAccess W4247656554 @default.
- W4247656554 hasPrimaryLocation W42476565541 @default.
- W4247656554 hasRelatedWork W1937260099 @default.
- W4247656554 hasRelatedWork W1964289883 @default.
- W4247656554 hasRelatedWork W2034114460 @default.
- W4247656554 hasRelatedWork W2123412267 @default.
- W4247656554 hasRelatedWork W2296273994 @default.
- W4247656554 hasRelatedWork W2952391767 @default.
- W4247656554 hasRelatedWork W3194176857 @default.
- W4247656554 hasRelatedWork W4206244388 @default.
- W4247656554 hasRelatedWork W4247656554 @default.
- W4247656554 hasRelatedWork W4299731236 @default.
- W4247656554 isParatext "false" @default.
- W4247656554 isRetracted "false" @default.
- W4247656554 workType "article" @default.