FRINK Linked Data Fragments server

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

• W4236077470 abstract "We consider the problem of estimating the value of MAXCUT in a graph in the streaming model of computation. We show that there exists a constant ∊* > 0 such that any randomized streaming algorithm that computes a (1 + ∊*)- approximation to MAX-CUT requires Ω(n) space on an n vertex graph. By contrast, there are algorithms that produce a (1 + ∊)-approximation in space O(n/∊2) for every ∊ > 0. Our result is the first linear space lower bound for the task of approximating the max cut value and partially answers an open question from the literature [2]. The prior state of the art ruled out (2 - ∊)-approximation in space or (1 + ∊)-approximation in space, for any ∊ > 0.Previous lower bounds for the MAX-CUT problem relied, in essence, on a lower bound on the communication complexity of the following task: Several players are each given some edges of a graph and they wish to determine if the union of these edges is ε-close to forming a bipartite graph, using one-way communication. The previous works proved a lower bound of for this task when ∊ = 1/2, and n1_O(∊) for every ∊ > 0, even when one of the players is given a candidate bipartition of the graph and the graph is promised to be bipartite with respect to this partition or ε-far from bipartite. This added information was essential in enabling the previous analyses but also yields a weak bound since, with this extra information, there is an n1_O(∊) communication protocol for this problem. In this work, we give an O(n) lower bound on the communication complexity of the original problem (without the extra information) for ∊ = Ω(1) in the three-player setting. Obtaining this O(n) lower bound on the communication complexity is the main technical result in this paper. We achieve it by a delicate choice of distributions on instances as well as a novel use of the convolution theorem from Fourier analysis combined with graph-theoretic considerations to analyze the communication complexity." @default.
• W4236077470 created "2022-05-12" @default.
• W4236077470 creator A5017844316 @default.
• W4236077470 creator A5039619350 @default.
• W4236077470 creator A5082285837 @default.
• W4236077470 creator A5086773451 @default.
• W4236077470 date "2017-01-01" @default.
• W4236077470 modified "2023-10-02" @default.
• W4236077470 title "(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space" @default.
• W4236077470 doi "https://doi.org/10.1137/1.9781611974782.112" @default.
• W4236077470 hasPublicationYear "2017" @default.
• W4236077470 type Work @default.
• W4236077470 citedByCount "6" @default.
• W4236077470 countsByYear W42360774702017 @default.
• W4236077470 countsByYear W42360774702020 @default.
• W4236077470 countsByYear W42360774702022 @default.
• W4236077470 countsByYear W42360774702023 @default.
• W4236077470 crossrefType "proceedings-article" @default.
• W4236077470 hasAuthorship W4236077470A5017844316 @default.
• W4236077470 hasAuthorship W4236077470A5039619350 @default.
• W4236077470 hasAuthorship W4236077470A5082285837 @default.
• W4236077470 hasAuthorship W4236077470A5086773451 @default.
• W4236077470 hasBestOaLocation W42360774701 @default.
• W4236077470 hasConcept C114614502 @default.
• W4236077470 hasConcept C118615104 @default.
• W4236077470 hasConcept C132525143 @default.
• W4236077470 hasConcept C134306372 @default.
• W4236077470 hasConcept C148764684 @default.
• W4236077470 hasConcept C176370821 @default.
• W4236077470 hasConcept C187166803 @default.
• W4236077470 hasConcept C197657726 @default.
• W4236077470 hasConcept C33923547 @default.
• W4236077470 hasConcept C77553402 @default.
• W4236077470 hasConcept C80899671 @default.
• W4236077470 hasConceptScore W4236077470C114614502 @default.
• W4236077470 hasConceptScore W4236077470C118615104 @default.
• W4236077470 hasConceptScore W4236077470C132525143 @default.
• W4236077470 hasConceptScore W4236077470C134306372 @default.
• W4236077470 hasConceptScore W4236077470C148764684 @default.
• W4236077470 hasConceptScore W4236077470C176370821 @default.
• W4236077470 hasConceptScore W4236077470C187166803 @default.
• W4236077470 hasConceptScore W4236077470C197657726 @default.
• W4236077470 hasConceptScore W4236077470C33923547 @default.
• W4236077470 hasConceptScore W4236077470C77553402 @default.
• W4236077470 hasConceptScore W4236077470C80899671 @default.
• W4236077470 hasLocation W42360774701 @default.
• W4236077470 hasOpenAccess W4236077470 @default.
• W4236077470 hasPrimaryLocation W42360774701 @default.
• W4236077470 hasRelatedWork W1779359754 @default.
• W4236077470 hasRelatedWork W1988771411 @default.
• W4236077470 hasRelatedWork W2021702479 @default.
• W4236077470 hasRelatedWork W2026407613 @default.
• W4236077470 hasRelatedWork W2089088747 @default.
• W4236077470 hasRelatedWork W2340841397 @default.
• W4236077470 hasRelatedWork W2587433615 @default.
• W4236077470 hasRelatedWork W2952349276 @default.
• W4236077470 hasRelatedWork W4297882665 @default.
• W4236077470 hasRelatedWork W4309591652 @default.
• W4236077470 isParatext "false" @default.
• W4236077470 isRetracted "false" @default.
• W4236077470 workType "article" @default.