Imagen de Portada

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Trabelsi, Ohad
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut
por: Chuzhoy, Julia, et al.
Publicado: (2025)

Faster All-Pairs Minimum Cut: Bypassing Exact Max-Flow
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

The Primal Pathwidth SETH
por: Lampis, Michael
Publicado: (2024)

k-SUM Hardness Implies Treewidth-SETH
por: Lampis, Michael
Publicado: (2025)

A Lower Bound for the Max Entropy Algorithm for TSP
por: Jin, Billy, et al.
Publicado: (2023)

Tight Pair Query Lower Bounds for Matching and Earth Mover's Distance
por: Azarmehr, Amir, et al.
Publicado: (2025)

A Note on Approximability of Densest At-Least-k-Subgraph
por: Laekhanukit, Bundit, et al.
Publicado: (2026)

Adaptive BSTs for Single-Source and All-to-All Requests: Algorithms and Lower Bounds
por: Shiran, Maryam
Publicado: (2025)

Lower Bounds on Flow Sparsifiers with Steiner Nodes
por: Chen, Yu, et al.
Publicado: (2026)

Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
por: Chuzhoy, Julia, et al.
Publicado: (2025)

Almost Tight Bounds for Online Hypergraph Matching
por: Tröbst, Thorben, et al.
Publicado: (2024)

One Attack to Rule Them All: Tight Quadratic Bounds for Adaptive Queries on Cardinality Sketches
por: Cohen, Edith, et al.
Publicado: (2024)

Almost Tight Bounds for Differentially Private Densest Subgraph
por: Dinitz, Michael, et al.
Publicado: (2023)

Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs
por: Khanna, Sanjeev, et al.
Publicado: (2024)

An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle
por: Caporrella, Matteo, et al.
Publicado: (2026)

Lower Bounds for Testing Directed Acyclicity in the Unidirectional Bounded-Degree Model
por: Yoshida, Yuichi
Publicado: (2026)

Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
por: Boneh, Itai, et al.
Publicado: (2025)

New Algorithms and Lower Bounds for Streaming Tournaments
por: Ghosh, Prantar, et al.
Publicado: (2024)

Lower Bounds on $0$-Extension with Steiner Nodes
por: Chen, Yu, et al.
Publicado: (2024)

Double Exponential Lower Bound for Telephone Broadcast
por: Tale, Prafullkumar
Publicado: (2024)

Dynamic PageRank: Algorithms and Lower Bounds
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Fine Grained Lower Bounds for Multidimensional Knapsack
por: Doron-Arad, Ilan, et al.
Publicado: (2024)

Faster All-Pairs Optimal Electric Car Routing
por: Dorfman, Dani, et al.
Publicado: (2025)

Faster Weak Expander Decompositions and Approximate Max Flow
por: Fleischmann, Henry, et al.
Publicado: (2025)

New algorithms for girth and cycle detection
por: Roditty, Liam, et al.
Publicado: (2025)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
por: Fei, Yumou, et al.
Publicado: (2025)

Improved Lower Bounds for Privacy under Continual Release
por: Aryanfard, Bardiya, et al.
Publicado: (2025)

Non-Signaling Locality Lower Bounds for Dominating Set
por: Fleming, Noah, et al.
Publicado: (2026)

Lower Bounds for Non-adaptive Local Computation Algorithms
por: Azarmehr, Amir, et al.
Publicado: (2025)

A Lower Bound for Light Spanners in General Graphs
por: Bodwin, Greg, et al.
Publicado: (2024)

Upper and Lower Bounds on the Smoothed Complexity of the Simplex Method
por: Huiberts, Sophie, et al.
Publicado: (2022)

Pareto Sums of Pareto Sets: Lower Bounds and Algorithms
por: Funke, Daniel, et al.
Publicado: (2024)

Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes
por: Duyster, Anouk, et al.
Publicado: (2026)

Partial Implementation of Max Flow and Min Cost Flow in Almost-Linear Time
por: Kavi, Nithin
Publicado: (2024)

Lower Bounds on Tree Covers
por: Chen, Yu, et al.
Publicado: (2025)

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
por: Dory, Michal, et al.
Publicado: (2022)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
por: Kikuchi, Masaru, et al.
Publicado: (2024)

All-Pairs Shortest Paths with Few Weights per Node
por: Abboud, Amir, et al.
Publicado: (2025)

Almost-Optimal Upper and Lower Bounds for Clustering in Low Dimensional Euclidean Spaces
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint
por: Doron-Arad, Ilan, et al.
Publicado: (2023)