Maximum Flow and Minimum-Cost Flow in Almost-Linear Time · HackerPapers discussions

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by vitus

Sun, 30 Jun 2024 01:04:52 GMT

That's because even the ACM link is an abbreviation of the actual paper. Preprint at https://arxiv.org/abs/2203.00671 (Pages 68-75 build up the full details of the bound, which looks something like Õ(mκ⁻²α⁻²ϵ⁻¹). There are enough details over the preceding dozens of pages that I can't tell at a glance exactly what all the variables stand for.) Technically this captures any logarithmic factors, such as exp(O(log^(7/8) m log log m)) as presented on page 75).

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by carterschonwald

Sat, 26 Aug 2023 22:23:19 GMT

https://arxiv.org/abs/2203.03456 And https://arxiv.org/abs/2203.00671 Are the relevant papers

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by sireat

Wed, 10 May 2023 18:24:30 GMT

For Maximum Flow (and Minimal Cut) through flow network we are getting close to linear time: 2022 Paper https://arxiv.org/abs/2203.00671

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by gfd

Mon, 27 Mar 2023 14:58:07 GMT

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time https://news.ycombinator.com/item?id=31675015 https://arxiv.org/abs/2203.00671

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by eynsham

Mon, 27 Feb 2023 05:35:52 GMT

If it’s NP it’s polynomially reducible to SAT. There are problems that do not admit a polynomial reduction to SAT, but by Cook-Levin they’re not in NP. It is of course possible to construct a problem that will require strictly more steps than the most efficient algorithm for SAT; for example, we could give a language SAT-PRIME = {<φ,n>: φ is satisfiable and n is prime>, which will take longer to decide than SAT. (Primality can be checked by the Agrawal–Kayal–Saxena test in polynomial time.) But note that SAT-PRIME is polynomially reducible to SAT, so on the notion of hardness as given by…

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by nothrowaways

Thu, 09 Jun 2022 07:23:08 GMT

Link to the paper https://arxiv.org/abs/2203.00671

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by pjdkoch

Thu, 09 Jun 2022 00:07:50 GMT

And the PDF here: https://arxiv.org/pdf/2203.00671v2.pdf

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by thorncorona

Wed, 08 Jun 2022 23:45:34 GMT

> Maximum Flow and Minimum-Cost Flow in Almost-Linear Time > We give an algorithm that computes exact maximum flows and minimum-cost flows on directed graphs with m edges and polynomially bounded integral demands, costs, and capacities in m^(1+o(1)) time. Our algorithm builds the flow through a sequence of m^(1+o(1)) approximate undirected minimum-ratio cycles, each of which is computed and processed in amortized m^o(1) time using a new dynamic graph data structure. ^ Our framework extends to algorithms running in m^(1+o(1)) time for computing flows that minimize general edge-separable convex…

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — mentioned by vkreso

Wed, 08 Jun 2022 23:12:56 GMT

The link to the paper is n the 1st paragraph: https://arxiv.org/abs/2203.00671

Paper and discussion history. A mention is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — HN submission

Sun, 24 Apr 2022 22:54:03 GMT

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

230 points; 40 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — HN submission

Mon, 07 Mar 2022 21:34:42 GMT

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time — HN submission

Wed, 02 Mar 2022 03:01:21 GMT

Maximum Flow and Minimum-Cost Flow in Almost-Linear Time

7 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.