FRINK Linked Data Fragments server

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

• W3127894499 abstract "Min-Cut queries are fundamental: Preprocess an undirected edge-weighted graph, to quickly report a minimum-weight cut that separates a query pair of nodes s, t. The best data structure known for this problem simply builds a cut-equivalent tree, discovered 60 years ago by Gomory and Hu, who also showed how to construct it using n-1 minimum st-cut computations. Using state-of-the-art algorithms for minimum st-cut (Lee and Sidford, FOCS 2014), one can construct the tree in time ~O(mn <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>3/2</sup> ), which is also the preprocessing time of the data structure. (Throughout, we focus on polynomially-bounded edge weights, noting that faster algorithms are known for small/ u nit edge weights, and use n and m for the number of nodes and edges in the graph.) Our main result shows the following equivalence: Cut-equivalent trees can be constructed in near-linear time if and only if there is a data structure for Min-Cut queries with near-linear preprocessing time and polylogarithmic (amortized) query time, and even if the queries are restricted to a fixed source. That is, equivalent trees are an essentially optimal solution for Min-Cut queries. This equivalence holds even for every minor-closed family of graphs, such as bounded-treewidth graphs, for which a two-decade old data structure (Arikati, Chaudhuri, and Zaroliagis, J. Algorithms 1998) implies the first near-linear time construction of cut-equivalent trees. Moreover, unlike all previous techniques for constructing cut-equivalent trees, ours is robust to relying on approximation algorithms. In particular, using the almost-linear time algorithm for ( 1+ε)-approximate minimum st-cut (Kelner, Lee, Orecchia, and Sidford, SODA 2014), we can construct a ( 1+ε)-approximate flow-equivalent tree (which is a slightly weaker notion) in time n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2+o(1)</sup> . This leads to the first ( 1+ε)-approximation for All-Pairs Max-Flow that runs in time n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2+o(1)</sup> , and matches the output size almost-optimally." @default.
• W3127894499 created "2021-02-15" @default.
• W3127894499 creator A5037378898 @default.
• W3127894499 creator A5051832024 @default.
• W3127894499 creator A5080971096 @default.
• W3127894499 date "2020-11-01" @default.
• W3127894499 modified "2023-10-11" @default.
• W3127894499 title "Cut-Equivalent Trees are Optimal for Min-Cut Queries" @default.
• W3127894499 cites W1543491698 @default.
• W3127894499 cites W1764956874 @default.
• W3127894499 cites W1973046087 @default.
• W3127894499 cites W1980410492 @default.
• W3127894499 cites W1986207529 @default.
• W3127894499 cites W1995945094 @default.
• W3127894499 cites W2000348096 @default.
• W3127894499 cites W2028643523 @default.
• W3127894499 cites W2032863725 @default.
• W3127894499 cites W2039305125 @default.
• W3127894499 cites W2067846943 @default.
• W3127894499 cites W2078658343 @default.
• W3127894499 cites W2086428052 @default.
• W3127894499 cites W2102347446 @default.
• W3127894499 cites W2115049345 @default.
• W3127894499 cites W2140498229 @default.
• W3127894499 cites W2145818650 @default.
• W3127894499 cites W2146409551 @default.
• W3127894499 cites W2162003279 @default.
• W3127894499 cites W2278710066 @default.
• W3127894499 cites W2610479830 @default.
• W3127894499 cites W2911302472 @default.
• W3127894499 cites W2962678445 @default.
• W3127894499 cites W2962913759 @default.
• W3127894499 cites W4246651639 @default.
• W3127894499 cites W4247278211 @default.
• W3127894499 cites W4252842032 @default.
• W3127894499 doi "https://doi.org/10.1109/focs46700.2020.00019" @default.
• W3127894499 hasPublicationYear "2020" @default.
• W3127894499 type Work @default.
• W3127894499 sameAs 3127894499 @default.
• W3127894499 citedByCount "13" @default.
• W3127894499 countsByYear W31278944992020 @default.
• W3127894499 countsByYear W31278944992021 @default.
• W3127894499 countsByYear W31278944992022 @default.
• W3127894499 countsByYear W31278944992023 @default.
• W3127894499 crossrefType "proceedings-article" @default.
• W3127894499 hasAuthorship W3127894499A5037378898 @default.
• W3127894499 hasAuthorship W3127894499A5051832024 @default.
• W3127894499 hasAuthorship W3127894499A5080971096 @default.
• W3127894499 hasBestOaLocation W31278944992 @default.
• W3127894499 hasConcept C114614502 @default.
• W3127894499 hasConcept C118615104 @default.
• W3127894499 hasConcept C132525143 @default.
• W3127894499 hasConcept C132569581 @default.
• W3127894499 hasConcept C134306372 @default.
• W3127894499 hasConcept C142417499 @default.
• W3127894499 hasConcept C162319229 @default.
• W3127894499 hasConcept C199360897 @default.
• W3127894499 hasConcept C203776342 @default.
• W3127894499 hasConcept C2780069185 @default.
• W3127894499 hasConcept C311688 @default.
• W3127894499 hasConcept C33923547 @default.
• W3127894499 hasConcept C34388435 @default.
• W3127894499 hasConcept C41008148 @default.
• W3127894499 hasConcept C43517604 @default.
• W3127894499 hasConceptScore W3127894499C114614502 @default.
• W3127894499 hasConceptScore W3127894499C118615104 @default.
• W3127894499 hasConceptScore W3127894499C132525143 @default.
• W3127894499 hasConceptScore W3127894499C132569581 @default.
• W3127894499 hasConceptScore W3127894499C134306372 @default.
• W3127894499 hasConceptScore W3127894499C142417499 @default.
• W3127894499 hasConceptScore W3127894499C162319229 @default.
• W3127894499 hasConceptScore W3127894499C199360897 @default.
• W3127894499 hasConceptScore W3127894499C203776342 @default.
• W3127894499 hasConceptScore W3127894499C2780069185 @default.
• W3127894499 hasConceptScore W3127894499C311688 @default.
• W3127894499 hasConceptScore W3127894499C33923547 @default.
• W3127894499 hasConceptScore W3127894499C34388435 @default.
• W3127894499 hasConceptScore W3127894499C41008148 @default.
• W3127894499 hasConceptScore W3127894499C43517604 @default.
• W3127894499 hasLocation W31278944991 @default.
• W3127894499 hasLocation W31278944992 @default.
• W3127894499 hasOpenAccess W3127894499 @default.
• W3127894499 hasPrimaryLocation W31278944991 @default.
• W3127894499 hasRelatedWork W1482484961 @default.
• W3127894499 hasRelatedWork W2065411828 @default.
• W3127894499 hasRelatedWork W2076407808 @default.
• W3127894499 hasRelatedWork W2184537587 @default.
• W3127894499 hasRelatedWork W3092127654 @default.
• W3127894499 hasRelatedWork W4235291009 @default.
• W3127894499 hasRelatedWork W4246145339 @default.
• W3127894499 hasRelatedWork W8290509 @default.
• W3127894499 hasRelatedWork W2018777660 @default.
• W3127894499 hasRelatedWork W2160217657 @default.
• W3127894499 isParatext "false" @default.
• W3127894499 isRetracted "false" @default.
• W3127894499 magId "3127894499" @default.
• W3127894499 workType "article" @default.