Matches in SemOpenAlex for { <https://semopenalex.org/work/W4387398438> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W4387398438 abstract "There has been a long history of studying randomized greedy matching algorithms since the work by Dyer and Frieze (RSA 1991). We follow this trend and consider the problem formulated in the oblivious setting, in which the vertex set of a graph is known to the algorithm, but not the edge set. The algorithm can make queries for the existence of the edge between any pair of vertices but must include the edge into the matching if it exists, i.e., as in the query-commit model by Gamlath et al. (SODA 2019). We revisit the Modified Randomized Greedy (MRG) algorithm by Aronson et al. (RSA 1995) that is proved to achieve a (0.5 + ϵ)-approximation. In each step of the algorithm, an unmatched vertex is chosen uniformly at random and matched to a randomly chosen neighbor (if exists). We study a weaker version of the algorithm named Random Decision Order (RDO) that, in each step, randomly picks an unmatched vertex and matches it to an arbitrary neighbor (if exists). We prove that the RDO algorithm provides a 0.639-approximation for bipartite graphs and 0.531-approximation for general graphs. As a corollary, we substantially improve the approximation ratio of MRG . Furthermore, we generalize the RDO algorithm to the edge-weighted case and prove that it achieves a 0.501 approximation ratio. This result solves the open question by Chan et al. (SICOMP 2018) and Gamlath et al. (SODA 2019) about the existence of an algorithm that beats greedy in edge-weighted general graphs, where the greedy algorithm probes the edges in descending order of edge-weights. We also present a variant of the algorithm that achieves a (1 − 1/ e )-approximation for edge-weighted bipartite graphs, which generalizes the (1 − 1/ e ) approximation ratio of Gamlath et al. (SODA 2019) for the stochastic setting to the case when the realizations of edges are arbitrarily correlated, where in the stochastic setting, there is a known probability associated with each pair of vertices that indicates the probability that an edge exists between the two vertices, when the pair is probed." @default.
- W4387398438 created "2023-10-07" @default.
- W4387398438 creator A5020048782 @default.
- W4387398438 creator A5032128738 @default.
- W4387398438 creator A5072788986 @default.
- W4387398438 date "2023-10-06" @default.
- W4387398438 modified "2023-10-07" @default.
- W4387398438 title "Towards a Better Understanding of Randomized Greedy Matching" @default.
- W4387398438 cites W1970411956 @default.
- W4387398438 cites W1986806918 @default.
- W4387398438 cites W2001426250 @default.
- W4387398438 cites W2079669094 @default.
- W4387398438 cites W2104224720 @default.
- W4387398438 cites W2612033967 @default.
- W4387398438 cites W2886153187 @default.
- W4387398438 cites W2963014036 @default.
- W4387398438 cites W3029111739 @default.
- W4387398438 cites W3123258615 @default.
- W4387398438 doi "https://doi.org/10.1145/3614318" @default.
- W4387398438 hasPublicationYear "2023" @default.
- W4387398438 type Work @default.
- W4387398438 citedByCount "0" @default.
- W4387398438 crossrefType "journal-article" @default.
- W4387398438 hasAuthorship W4387398438A5020048782 @default.
- W4387398438 hasAuthorship W4387398438A5032128738 @default.
- W4387398438 hasAuthorship W4387398438A5072788986 @default.
- W4387398438 hasBestOaLocation W43873984381 @default.
- W4387398438 hasConcept C105795698 @default.
- W4387398438 hasConcept C11413529 @default.
- W4387398438 hasConcept C114614502 @default.
- W4387398438 hasConcept C118615104 @default.
- W4387398438 hasConcept C122818955 @default.
- W4387398438 hasConcept C128669082 @default.
- W4387398438 hasConcept C132525143 @default.
- W4387398438 hasConcept C148764684 @default.
- W4387398438 hasConcept C165064840 @default.
- W4387398438 hasConcept C197657726 @default.
- W4387398438 hasConcept C2780012671 @default.
- W4387398438 hasConcept C33923547 @default.
- W4387398438 hasConcept C51823790 @default.
- W4387398438 hasConcept C80899671 @default.
- W4387398438 hasConceptScore W4387398438C105795698 @default.
- W4387398438 hasConceptScore W4387398438C11413529 @default.
- W4387398438 hasConceptScore W4387398438C114614502 @default.
- W4387398438 hasConceptScore W4387398438C118615104 @default.
- W4387398438 hasConceptScore W4387398438C122818955 @default.
- W4387398438 hasConceptScore W4387398438C128669082 @default.
- W4387398438 hasConceptScore W4387398438C132525143 @default.
- W4387398438 hasConceptScore W4387398438C148764684 @default.
- W4387398438 hasConceptScore W4387398438C165064840 @default.
- W4387398438 hasConceptScore W4387398438C197657726 @default.
- W4387398438 hasConceptScore W4387398438C2780012671 @default.
- W4387398438 hasConceptScore W4387398438C33923547 @default.
- W4387398438 hasConceptScore W4387398438C51823790 @default.
- W4387398438 hasConceptScore W4387398438C80899671 @default.
- W4387398438 hasLocation W43873984381 @default.
- W4387398438 hasOpenAccess W4387398438 @default.
- W4387398438 hasPrimaryLocation W43873984381 @default.
- W4387398438 hasRelatedWork W1594413663 @default.
- W4387398438 hasRelatedWork W189401716 @default.
- W4387398438 hasRelatedWork W2019216770 @default.
- W4387398438 hasRelatedWork W2045237525 @default.
- W4387398438 hasRelatedWork W2073435288 @default.
- W4387398438 hasRelatedWork W2163115662 @default.
- W4387398438 hasRelatedWork W2544904580 @default.
- W4387398438 hasRelatedWork W2574250816 @default.
- W4387398438 hasRelatedWork W3117290964 @default.
- W4387398438 hasRelatedWork W3204684126 @default.
- W4387398438 isParatext "false" @default.
- W4387398438 isRetracted "false" @default.
- W4387398438 workType "article" @default.