Matches in SemOpenAlex for { <https://semopenalex.org/work/W4286224640> ?p ?o ?g. }
Showing items 1 to 75 of
75
with 100 items per page.
- W4286224640 abstract "We present a new approach for finding matchings in dense graphs by building on Szemer'edi's celebrated Regularity Lemma. This allows us to obtain non-trivial albeit slight improvements over longstanding bounds for matchings in streaming and dynamic graphs. In particular, we establish the following results for $n$-vertex graphs: * A deterministic single-pass streaming algorithm that finds a $(1-o(1))$-approximate matching in $o(n^2)$ bits of space. This constitutes the first single-pass algorithm for this problem in sublinear space that improves over the $frac{1}{2}$-approximation of the greedy algorithm. * A randomized fully dynamic algorithm that with high probability maintains a $(1-o(1))$-approximate matching in $o(n)$ worst-case update time per each edge insertion or deletion. The algorithm works even against an adaptive adversary. This is the first $o(n)$ update-time dynamic algorithm with approximation guarantee arbitrarily close to one. Given the use of regularity lemma, the improvement obtained by our algorithms over trivial bounds is only by some $(log^*{n})^{Theta(1)}$ factor. Nevertheless, in each case, they show that the ``right'' answer to the problem is not what is dictated by the previous bounds. Finally, in the streaming model, we also present a randomized $(1-o(1))$-approximation algorithm whose space can be upper bounded by the density of certain Ruzsa-Szemer'edi (RS) graphs. While RS graphs by now have been used extensively to prove streaming lower bounds, ours is the first to use them as an upper bound tool for designing improved streaming algorithms." @default.
- W4286224640 created "2022-07-21" @default.
- W4286224640 creator A5001014826 @default.
- W4286224640 creator A5025934584 @default.
- W4286224640 creator A5039619350 @default.
- W4286224640 creator A5060978295 @default.
- W4286224640 date "2022-07-19" @default.
- W4286224640 modified "2023-09-26" @default.
- W4286224640 title "On Regularity Lemma and Barriers in Streaming and Dynamic Matching" @default.
- W4286224640 doi "https://doi.org/10.48550/arxiv.2207.09354" @default.
- W4286224640 hasPublicationYear "2022" @default.
- W4286224640 type Work @default.
- W4286224640 citedByCount "0" @default.
- W4286224640 crossrefType "posted-content" @default.
- W4286224640 hasAuthorship W4286224640A5001014826 @default.
- W4286224640 hasAuthorship W4286224640A5025934584 @default.
- W4286224640 hasAuthorship W4286224640A5039619350 @default.
- W4286224640 hasAuthorship W4286224640A5060978295 @default.
- W4286224640 hasBestOaLocation W42862246401 @default.
- W4286224640 hasConcept C105795698 @default.
- W4286224640 hasConcept C11413529 @default.
- W4286224640 hasConcept C114614502 @default.
- W4286224640 hasConcept C117160843 @default.
- W4286224640 hasConcept C118615104 @default.
- W4286224640 hasConcept C132525143 @default.
- W4286224640 hasConcept C134306372 @default.
- W4286224640 hasConcept C13533509 @default.
- W4286224640 hasConcept C148764684 @default.
- W4286224640 hasConcept C165064840 @default.
- W4286224640 hasConcept C187166803 @default.
- W4286224640 hasConcept C18903297 @default.
- W4286224640 hasConcept C2777759810 @default.
- W4286224640 hasConcept C33923547 @default.
- W4286224640 hasConcept C34388435 @default.
- W4286224640 hasConcept C46757340 @default.
- W4286224640 hasConcept C51823790 @default.
- W4286224640 hasConcept C77553402 @default.
- W4286224640 hasConcept C80899671 @default.
- W4286224640 hasConcept C86803240 @default.
- W4286224640 hasConceptScore W4286224640C105795698 @default.
- W4286224640 hasConceptScore W4286224640C11413529 @default.
- W4286224640 hasConceptScore W4286224640C114614502 @default.
- W4286224640 hasConceptScore W4286224640C117160843 @default.
- W4286224640 hasConceptScore W4286224640C118615104 @default.
- W4286224640 hasConceptScore W4286224640C132525143 @default.
- W4286224640 hasConceptScore W4286224640C134306372 @default.
- W4286224640 hasConceptScore W4286224640C13533509 @default.
- W4286224640 hasConceptScore W4286224640C148764684 @default.
- W4286224640 hasConceptScore W4286224640C165064840 @default.
- W4286224640 hasConceptScore W4286224640C187166803 @default.
- W4286224640 hasConceptScore W4286224640C18903297 @default.
- W4286224640 hasConceptScore W4286224640C2777759810 @default.
- W4286224640 hasConceptScore W4286224640C33923547 @default.
- W4286224640 hasConceptScore W4286224640C34388435 @default.
- W4286224640 hasConceptScore W4286224640C46757340 @default.
- W4286224640 hasConceptScore W4286224640C51823790 @default.
- W4286224640 hasConceptScore W4286224640C77553402 @default.
- W4286224640 hasConceptScore W4286224640C80899671 @default.
- W4286224640 hasConceptScore W4286224640C86803240 @default.
- W4286224640 hasLocation W42862246401 @default.
- W4286224640 hasOpenAccess W4286224640 @default.
- W4286224640 hasPrimaryLocation W42862246401 @default.
- W4286224640 hasRelatedWork W2004533347 @default.
- W4286224640 hasRelatedWork W2102098509 @default.
- W4286224640 hasRelatedWork W2396989770 @default.
- W4286224640 hasRelatedWork W2550348207 @default.
- W4286224640 hasRelatedWork W2950301323 @default.
- W4286224640 hasRelatedWork W2973164778 @default.
- W4286224640 hasRelatedWork W3158958986 @default.
- W4286224640 hasRelatedWork W3184929353 @default.
- W4286224640 hasRelatedWork W4283699216 @default.
- W4286224640 hasRelatedWork W4286224640 @default.
- W4286224640 isParatext "false" @default.
- W4286224640 isRetracted "false" @default.
- W4286224640 workType "article" @default.