FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2155096670> ?p ?o ?g. }

• W2155096670 abstract "In this paper, we study an online bipartite matching problem, motivated by applications in wireless communication, content delivery, and job scheduling. In our problem, we have a bipartite graph G between n clients and n servers, which represents the servers to which each client can connect. Although the edges of G are unknown at the start, we learn the graph over time, as each client arrives and requests to be matched to a server. As each client arrives, she reveals the servers to which she can connect, and the goal of the algorithm is to maintain a matching between the clients who have arrived and the servers. Assuming that G has a perfect matching which allows all clients to be matched to servers, the goal of the online algorithm is to minimize the switching cost, the total number of times a client needs to switch servers in order to maintain a matching at all times. Although there are no known algorithms which are guaranteed to yield switching cost better than the trivial O(n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> ) in the worst case, we show that the switching cost can be much lower in three natural settings. In our first result, we show that for any arbitrary graph G with a perfect matching, if the clients arrive in random order, then the total switching cost is only O(n log n) with high probability. This bound is tight, as we show an example where the switching cost is Omega(n log n) in expectation. In our second result, we show that if each client has edges to Theta(log n) uniformly random servers, then the total switching cost is even better; in this case, it is only O(n) with high probability, and we also have a lower bound of Omega(n/log n). In terms of the number of edges needed for each client, our result is tight, since Omega(log n) edges are needed to guarantee a perfect matching in G with high probability. In our last result, we derive the first algorithm known to yield total cost O(n log n), given that the underlying graph G is a forest. This is the first result known to match the existing lower bound for forests, which shows that any online algorithm must have switching cost Omega(n log n), even when G is restricted to be a forest." @default.
• W2155096670 created "2016-06-24" @default.
• W2155096670 creator A5010790447 @default.
• W2155096670 creator A5013747946 @default.
• W2155096670 creator A5034822411 @default.
• W2155096670 creator A5040052580 @default.
• W2155096670 date "2009-04-01" @default.
• W2155096670 modified "2023-09-23" @default.
• W2155096670 title "Online Bipartite Perfect Matching With Augmentations" @default.
• W2155096670 cites W1501694180 @default.
• W2155096670 cites W1547923038 @default.
• W2155096670 cites W1998128290 @default.
• W2155096670 cites W2064467943 @default.
• W2155096670 cites W2131951207 @default.
• W2155096670 cites W2162656786 @default.
• W2155096670 doi "https://doi.org/10.1109/infcom.2009.5062016" @default.
• W2155096670 hasPublicationYear "2009" @default.
• W2155096670 type Work @default.
• W2155096670 sameAs 2155096670 @default.
• W2155096670 citedByCount "31" @default.
• W2155096670 countsByYear W21550966702012 @default.
• W2155096670 countsByYear W21550966702014 @default.
• W2155096670 countsByYear W21550966702015 @default.
• W2155096670 countsByYear W21550966702016 @default.
• W2155096670 countsByYear W21550966702017 @default.
• W2155096670 countsByYear W21550966702018 @default.
• W2155096670 countsByYear W21550966702019 @default.
• W2155096670 countsByYear W21550966702020 @default.
• W2155096670 countsByYear W21550966702021 @default.
• W2155096670 crossrefType "proceedings-article" @default.
• W2155096670 hasAuthorship W2155096670A5010790447 @default.
• W2155096670 hasAuthorship W2155096670A5013747946 @default.
• W2155096670 hasAuthorship W2155096670A5034822411 @default.
• W2155096670 hasAuthorship W2155096670A5040052580 @default.
• W2155096670 hasConcept C105795698 @default.
• W2155096670 hasConcept C11413529 @default.
• W2155096670 hasConcept C126255220 @default.
• W2155096670 hasConcept C132525143 @default.
• W2155096670 hasConcept C134306372 @default.
• W2155096670 hasConcept C165064840 @default.
• W2155096670 hasConcept C196921405 @default.
• W2155096670 hasConcept C197657726 @default.
• W2155096670 hasConcept C206729178 @default.
• W2155096670 hasConcept C31258907 @default.
• W2155096670 hasConcept C33923547 @default.
• W2155096670 hasConcept C41008148 @default.
• W2155096670 hasConcept C77553402 @default.
• W2155096670 hasConcept C80444323 @default.
• W2155096670 hasConcept C93996380 @default.
• W2155096670 hasConceptScore W2155096670C105795698 @default.
• W2155096670 hasConceptScore W2155096670C11413529 @default.
• W2155096670 hasConceptScore W2155096670C126255220 @default.
• W2155096670 hasConceptScore W2155096670C132525143 @default.
• W2155096670 hasConceptScore W2155096670C134306372 @default.
• W2155096670 hasConceptScore W2155096670C165064840 @default.
• W2155096670 hasConceptScore W2155096670C196921405 @default.
• W2155096670 hasConceptScore W2155096670C197657726 @default.
• W2155096670 hasConceptScore W2155096670C206729178 @default.
• W2155096670 hasConceptScore W2155096670C31258907 @default.
• W2155096670 hasConceptScore W2155096670C33923547 @default.
• W2155096670 hasConceptScore W2155096670C41008148 @default.
• W2155096670 hasConceptScore W2155096670C77553402 @default.
• W2155096670 hasConceptScore W2155096670C80444323 @default.
• W2155096670 hasConceptScore W2155096670C93996380 @default.
• W2155096670 hasLocation W21550966701 @default.
• W2155096670 hasOpenAccess W2155096670 @default.
• W2155096670 hasPrimaryLocation W21550966701 @default.
• W2155096670 hasRelatedWork W126006422 @default.
• W2155096670 hasRelatedWork W2051294918 @default.
• W2155096670 hasRelatedWork W2750046462 @default.
• W2155096670 hasRelatedWork W2809638413 @default.
• W2155096670 hasRelatedWork W2902906275 @default.
• W2155096670 hasRelatedWork W2950878225 @default.
• W2155096670 hasRelatedWork W3000166930 @default.
• W2155096670 hasRelatedWork W4287905780 @default.
• W2155096670 hasRelatedWork W4288333954 @default.
• W2155096670 hasRelatedWork W4289236540 @default.
• W2155096670 isParatext "false" @default.
• W2155096670 isRetracted "false" @default.
• W2155096670 magId "2155096670" @default.
• W2155096670 workType "article" @default.