scientific article; zbMATH DE number 7204472

DOI10.4230/LIPICS.ICALP.2017.20zbMATH Open1441.68077arXiv1702.05805MaRDI QIDQ5111350FDOQ5111350

Robert Krauthgamer, Ohad Trabelsi

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1702.05805

Title of this publication is not available (Why is that?)

Recommendations

• Conditional Lower Bounds for All-Pairs Max-Flow
• scientific article
• An $o(n^3 )$-Time Maximum-Flow Algorithm

zbMATH Keywords

strong exponential time hypothesishardness in Pconditional lower boundsall-pairs maximum flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (1)

• Conditional Lower Bounds for All-Pairs Max-Flow

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111350)